Contract bridge probabilities

{{Short description|Mathematical probabilities in the game of bridge}}

In the game of bridge mathematical probabilities play a significant role. Different declarer play strategies lead to success depending on the distribution of opponent's cards. To decide which strategy has highest likelihood of success, the declarer needs to have at least an elementary knowledge of probabilities.

The tables below specify the various prior probabilities, i.e. the probabilities in the absence of any further information. During bidding and play, more information about the hands becomes available, allowing players to improve their probability estimates.

Probability of suit distributions (for missing trumps, etc.) in two hidden hands

This table"Mathematical Tables" (Table 4). {{OEB|5|278}} represents the different ways that two to eight particular cards may be distributed, or may lie or split, between two unknown 13-card hands (before the bidding and play, or a priori).

The table also shows the number of combinations of particular cards that match any numerical split and the probabilities for each combination.

These probabilities follow directly from the law of Vacant Places.

class=wikitable

!width=100|Number of cards (trumps, etc.) missing from partnership

DistributionProbabilityCombinationsIndividual
Probability
rowspan=2|21 - 10.5220.26
2 - 00.4820.24
rowspan=2|32 - 10.7860.13
3 - 00.2220.11
rowspan=3|42 - 20.4060.0678~
3 - 10.5080.0622~
4 - 00.1020.0478~
rowspan=3|53 - 20.68200.0339~
4 - 10.28100.02826~
5 - 00.0420.01956~
rowspan=4|63 - 30.36200.01776~
4 - 20.48300.01615~
5 - 10.15120.01211~
6 - 00.0120.00745~
rowspan=4|74 - 30.62700.00888~
5 - 20.30420.00727~
6 - 10.07140.00484~
7 - 00.0120.00261~
rowspan=5|84 - 40.33700.00467~
5 - 30.471120.00421~
6 - 20.17560.00306~
7 - 10.03160.00178~
8 - 00.0020.00082~

= Calculation of probabilities =

Let P'(a, b, n_e, n_w) be the probability of an East player with n_e unknown cards holding a cards in a given suit and a West player with n_w unknown cards holding b cards in the given suit. The total number of arrangements of (a+b) cards in the suit in (n_e + n_w) spaces is T = \frac{(n_e + n_w)!}{(n_e + n_w - a - b)!(a + b)!} i.e. the number of permutations of (n_e + n_w) objects of which cards in the suit are indistinguishable and cards not in the suit are indistinguishable. The number of arrangements of which correspond to East having a cards in the suit and West b cards in the suit is given by S = \frac{n_e!}{a!(n_e - a)!} \times \frac{n_w!}{b!(n_w - b)!}. Therefore, P'(a, b, n_e, n_w) = \frac{S}{T} = \frac{(a+b)!}{a!b!} \times \frac{n_e!n_w!(n_e + n_w - a - b)!}{(n_e+n_w)!(n_e - a)! (n_w - b)!} = \binom{a+b}{a}\frac{n_e!n_w!(n_e + n_w - a - b)!}{(n_e+n_w)!(n_e - a)! (n_w - b)!}=\frac{\binom{a+b}{a}\binom{n_e+n_w-a-b}{n_e-a}}{\binom{n_e+n_w}{n_e}}If the direction of the split is unimportant (it is only required that the split be a-b, not that East is specifically required to hold a cards), then the overall probability is given byP(a, b, n_e, n_w) = P'(a, b, n_e, n_w) + (1-\delta_{a, b})P'(b, a, n_e, n_w) where the Kronecker delta ensures that the situation where East and West have the same number of cards in the suit is not counted twice.

The above probabilities assume n_e = n_w = 13 and that the direction of the split is unimportant, and so are given byP(a, b) = P(a, b, 13, 13) = \binom{a+b}{a}\frac{13!13!(26-a-b)!}{26!(13-a)!(13-b)!}(2-\delta_{a,b})The more general formula can be used to calculate the probability of a suit breaking if a player is known to have cards in another suit from e.g. the bidding. Suppose East is known to have 7 spades from the bidding and after seeing dummy you deduce West to hold 2 spades; then if your two lines of play are to hope either for diamonds 5-3 or clubs 4-2, the a priori probabilities are 47% and 48% respectively but P(5, 3, 13-7, 13-2) \thickapprox 42\% and P(4, 2, 13-7, 13-2) \thickapprox 47\% so now the club line is significantly better than the diamond line.

Probability of HCP distribution

High card points (HCP) are usually counted using the Milton Work scale of 4/3/2/1 points for each Ace/King/Queen/Jack respectively. The a priori probabilities that a given hand contains no more than a specified number of HCP is given in the table below. To find the likelihood of a certain point range, one simply subtracts the two relevant cumulative probabilities. So, the likelihood of being dealt a 12-19 HCP hand (ranges inclusive) is the probability of having at most 19 HCP minus the probability of having at most 11 HCP, or: 0.9855 − 0.6518 = 0.3337.Richard Pavlicek. "High Card Expectancy." [http://www.rpbridge.net/7z76.htm link]

class=wikitable

!HCP

Probabilityrowspan="9"|HCPProbabilityrowspan="9"|HCPProbabilityrowspan="9"|HCPProbabilityrowspan="9"|HCPProbability
00.00363980.374768160.935520240.999542321.000000
10.01152390.468331170.959137250.999806331.000000
20.025085100.562382180.975187260.999923341.000000
30.049708110.651828190.985549270.999972351.000000
40.088163120.732097200.991985280.999990361.000000
50.140025130.801240210.995763290.999997371.000000
60.205565140.858174220.997864300.999999
70.285846150.902410230.998983311.000000

Hand pattern probabilities

A hand pattern denotes the distribution of the thirteen cards in a hand over the four suits. In total 39 hand patterns are possible, but only 13 of them have an a priori probability exceeding 1%. The most likely pattern is the 4-4-3-2 pattern consisting of two four-card suits, a three-card suit and a doubleton.

Note that the hand pattern leaves unspecified which particular suits contain the indicated lengths. For a 4-4-3-2 pattern, one needs to specify which suit contains the three-card and which suit contains the doubleton in order to identify the length in each of the four suits. There are four possibilities to first identify the three-card suit and three possibilities to next identify the doubleton. Hence, the number of suit permutations of the 4-4-3-2 pattern is twelve. Or, stated differently, in total there are twelve ways a 4-4-3-2 pattern can be mapped onto the four suits.

Below table lists all 39 possible hand patterns, their probability of occurrence, as well as the number of suit permutations for each pattern. The list is ordered according to likelihood of occurrence of the hand patterns.Richard Pavlicek. "Against All Odds." [http://www.rpbridge.net/7z77.htm link]

{|class=wikitable

!Pattern

Probability#
4-4-3-20.2155112
5-3-3-20.1551712
5-4-3-10.1293124
5-4-2-20.1058012
4-3-3-30.10536align="right"|4
6-3-2-20.0564212
6-4-2-10.0470224
6-3-3-10.0344812
5-5-2-10.0317412
4-4-4-10.02993align="right"|4
7-3-2-10.0188124
6-4-3-00.0132624
5-4-4-00.0124312

|

class=wikitable

!Pattern

Probability#
5-5-3-00.0089512
6-5-1-10.0070512
6-5-2-00.0065124
7-2-2-20.00513align="right"|4
7-4-1-10.0039212
7-4-2-00.0036224
7-3-3-00.0026512
8-2-2-10.0019212
8-3-1-10.0011812
7-5-1-00.0010924
8-3-2-00.0010924
6-6-1-00.0007212
8-4-1-00.0004524

|

class=wikitable

!Pattern

Probability#
9-2-1-10.0001812
9-3-1-00.0001024
9-2-2-00.00008212
7-6-0-00.00005612
8-5-0-00.00003112
10-2-1-00.00001124
9-4-0-00.000009712
10-1-1-10.0000040align="right"|4
10-3-0-00.000001512
11-1-1-00.0000002512
11-2-0-00.0000001112
12-1-0-00.000000003212
13-0-0-00.0000000000063align="right"|4

|

|}

The 39 hand patterns can by classified into four hand types: balanced hands, single suiters, two suiters and three-suiters. Below table gives the a priori likelihoods of being dealt a certain hand-type.

class=wikitable

!Hand type

PatternsProbability
3 Balanced4-3-3-3, 4-4-3-2, 5-3-3-20.4761
26
Single-suited
6-3-2-2, 6-3-3-1, 6-4-2-1, 6-4-3-0, 7-2-2-2, 7-3-2-1, 7-3-3-0, 7-4-1-1, 7-4-2-0, 7-5-1-0, 8-2-2-1, 8-3-1-1, 8-3-2-0, 8-4-1-0, 8-5-0-0, 9-2-1-1, 9-2-2-0, 9-3-1-0, 9-4-0-0, 10-1-1-1, 10-2-1-0, 10-3-0-0, 11-1-1-0, 11-2-0-0, 12-1-0-0, 13-0-0-00.1915
8 Two-suited5-4-2-2, 5-4-3-1, 5-5-2-1, 5-5-3-0, 6-5-1-1, 6-5-2-0, 6-6-1-0, 7-6-0-00.2902
2 Three-suited4-4-4-1, 5-4-4-00.0423

Alternative grouping of the 39 hand patterns can be made either by longest suit or by shortest suit. Below tables gives the a priori chance of being dealt a hand with a longest or a shortest suit of given length.

class=wikitable

!Longest suit

PatternsProbability
4 card4-3-3-3, 4-4-3-2, 4-4-4-10.3508
5 card5-3-3-2, 5-4-2-2, 5-4-3-1, 5-5-2-1, 5-4-4-0, 5-5-3-00.4434
6 card6-3-2-2, 6-3-3-1, 6-4-2-1, 6-4-3-0, 6-5-1-1, 6-5-2-0, 6-6-1-00.1655
7 card7-2-2-2, 7-3-2-1, 7-3-3-0, 7-4-1-1, 7-4-2-0, 7-5-1-0, 7-6-0-00.0353
8 card8-2-2-1, 8-3-1-1, 8-3-2-0, 8-4-1-0, 8-5-0-00.0047
9 card9-2-1-1, 9-2-2-0, 9-3-1-0, 9-4-0-00.00037
10 card10-1-1-1, 10-2-1-0, 10-3-0-00.000017
11 card11-1-1-0, 11-2-0-00.0000003
12 card12-1-0-00.000000003
13 card13-0-0-00.000000000006

class=wikitable

!Shortest suit

PatternsProbability
Three card4-3-3-30.1054
Doubleton4-4-3-2, 5-3-3-2, 5-4-2-2, 6-3-2-2, 7-2-2-20.5380
Singleton4-4-4-1, 5-4-3-1, 5-5-2-1, 6-3-3-1, 6-4-2-1, 6-5-1-1, 7-3-2-1, 7-4-1-1, 8-2-2-1, 8-3-1-1, 9-2-1-1, 10-1-1-10.3055
Void5-4-4-0, 5-5-3-0, 6-4-3-0, 6-5-2-0, 6-6-1-0, 7-3-3-0, 7-4-2-0, 7-5-1-0, 7-6-0-0, 8-3-2-0, 8-4-1-0, 8-5-0-0, 9-2-2-0, 9-3-1-0, 9-4-0-0, 10-2-1-0, 10-3-0-0, 11-1-1-0, 11-2-0-0, 12-1-0-0, 13-0-0-00.0511

Number of possible hands and deals

There are 635,013,559,600 ({52 \choose 13}) different hands that one player can hold.[http://www.durangobill.com/BrPtCntHowTo.html Durango Bill's Bridge Probabilities and Combinatorics 1] Furthermore, when the remaining 39 cards are included with all their combinations there are 53,644,737,765,488,792,839,237,440,000 (53.6 x 1027) different deals possible (52!/(13!)^4) [http://www.durangobill.com/Bridge.html Durango Bill's Bridge Probabilities and Combinatorics 2] The immenseness of this number can be understood by answering the question "How large an area would you need to spread all possible bridge deals if each deal would occupy only one square millimeter?". The answer is: an area more than a hundred million times the surface area of Earth.

Obviously, the deals that are identical except for swapping—say—the {{Hearts}}2 and the {{Hearts}}3 would be unlikely to give a different result. To make the irrelevance of small cards explicit (which is not always the case though), in bridge such small cards are generally denoted by an 'x'. Thus, the "number of possible deals" in this sense depends on how many non-honour cards (2, 3, .. 9) are considered 'indistinguishable'. For example, if 'x' notation is applied to all cards smaller than ten, then the suit distributions A987-K106-Q54-J32 and A432-K105-Q76-J98 would be considered identical.

The table below [http://home.planet.nl/~narcis45/CountingBridgeDeals.htm Counting Bridge Deals], Jeroen Warmerdam gives the number of deals when various numbers of small cards are considered indistinguishable.

class=wikitable

!Highest undistinguished card

Number of deals
2align="right"|53,644,737,765,488,792,839,237,440,000
3align="right"| 7,811,544,503,918,790,990,995,915,520
4align="right"| 445,905,120,201,773,774,566,940,160
5align="right"| 14,369,217,850,047,151,709,620,800
6align="right"| 314,174,475,847,313,213,527,680
7align="right"| 5,197,480,921,767,366,548,160
8align="right"| 69,848,690,581,204,198,656
9align="right"| 800,827,437,699,287,808
10align="right"| 8,110,864,720,503,360
Jalign="right"| 74,424,657,938,928
Qalign="right"| 630,343,600,320
Kalign="right"| 4,997,094,488
Aalign="right"| 37,478,624

Note that the last entry in the table (37,478,624) corresponds to the number of different distributions of the deck (the number of deals when cards are only distinguished by their suit).

Probability of Losing-Trick Counts

The Losing-Trick Count is an alternative to the HCP count as a method of hand evaluation.

class="wikitable"
LTCNumber of HandsProbability
04,245,0320.000668%
190,206,0440.0142%
2872,361,9360.137%
35,080,948,4280.8%
419,749,204,7803.11%
553,704,810,5608.46%
6104,416,332,34016.4%
7145,971,648,36023.0%
8145,394,132,76022.9%
9100,454,895,36015.8%
1045,618,822,0007.18%
1112,204,432,0001.92%
121,451,520,0000.229%
1312 is the maximumN/A

References

Further reading

  • {{cite book

|last1 = Émile

|first1 = Borel

|last2 = André

|first2 = Chéron

|title = Théorie Mathématique du Bridge

|publisher = Gauthier-Villars

|year = 1940

}} Second French edition by the authors in 1954. Translated and edited into English by Alec Traub as The Mathematical Theory of Bridge; printed in 1974 in Taiwan through the assistance of C.C. Wei.

  • {{cite book

|last1 = Kelsey

|first1 = Hugh

|author-link1 = Hugh Kelsey

|last2 = Glauert

|first2 = Michael

|title = Bridge Odds for Practical Players

|publisher = Victor Gollancz Ltd in association with Peter Crawley

|location = London

|series = Master Bridge Series

|year = 1980

|isbn = 0-575-02799-1}}

  • {{cite book

|last1 = Reese

|first1 = Terence

|author-link1 = Terence Reese

|last2 = Trézel

|first2 = Roger

|author-link2 = Roger Trézel

|title = Master the Odds in Bridge

|publisher = Victor Gollancz Ltd in association with Peter Crawley

|location = London

|series = Master Bridge Series

|year = 1986

|isbn = 0-575-02597-2}}

{{WPCBIndex}}