Contract bridge probabilities

Last updated

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.

Contents

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 [1] 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.

Number of cards (trumps, etc.) missing from partnershipDistributionProbabilityCombinationsIndividual
Probability
21 - 10.5220.26
2 - 00.4820.24
32 - 10.7860.13
3 - 00.2220.11
42 - 20.4060.0678~
3 - 10.5080.0622~
4 - 00.1020.0478~
53 - 20.68200.0339~
4 - 10.28100.02826~
5 - 00.0420.01956~
63 - 30.36200.01776~
4 - 20.48300.01615~
5 - 10.15120.01211~
6 - 00.0120.00745~
74 - 30.62700.00888~
5 - 20.30420.00727~
6 - 10.07140.00484~
7 - 00.0120.00261~
84 - 40.33700.00467~
5 - 30.471120.00421~
6 - 20.17560.00306~
7 - 10.03160.00178~
8 - 00.0020.00082~

Calculation of probabilities

Let be the probability of an East player with unknown cards holding cards in a given suit and a West player with unknown cards holding cards in the given suit. The total number of arrangements of cards in the suit in spaces is i.e. the number of permutations of 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 cards in the suit and West cards in the suit is given by . Therefore,

If the direction of the split is unimportant (it is only required that the split be -, not that East is specifically required to hold cards), then the overall probability is given by

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 and that the direction of the split is unimportant, and so are given by

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 and 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. [1] 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. [2]

HCPProbabilityHCPProbabilityHCPProbabilityHCPProbabilityHCPProbability
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. [3]

PatternProbability#
4-4-3-20.2155112
5-3-3-20.1551712
5-4-3-10.1293124
5-4-2-20.1058012
4-3-3-30.105364
6-3-2-20.0564212
6-4-2-10.0470224
6-3-3-10.0344812
5-5-2-10.0317412
4-4-4-10.029934
7-3-2-10.0188124
6-4-3-00.0132624
5-4-4-00.0124312
PatternProbability#
5-5-3-00.0089512
6-5-1-10.0070512
6-5-2-00.0065124
7-2-2-20.005134
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
PatternProbability#
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.00000404
10-3-0-00.000001512
11-1-1-00.0000002512
11-2-0-00.0000001112
12-1-0-00.000000003212
13-0-0-00.00000000000634

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.

Hand typePatternsProbability
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.

Longest suitPatternsProbability
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
Shortest suitPatternsProbability
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 () different hands that one player can hold. [4] 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 () [5] 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 2 and the 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 [6] gives the number of deals when various numbers of small cards are considered indistinguishable.

Highest undistinguished cardNumber of deals
253,644,737,765,488,792,839,237,440,000
37,811,544,503,918,790,990,995,915,520
4445,905,120,201,773,774,566,940,160
514,369,217,850,047,151,709,620,800
6314,174,475,847,313,213,527,680
75,197,480,921,767,366,548,160
869,848,690,581,204,198,656
9800,827,437,699,287,808
108,110,864,720,503,360
J74,424,657,938,928
Q630,343,600,320
K4,997,094,488
A37,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.

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

Related Research Articles

<span class="mw-page-title-main">Binomial distribution</span> Probability distribution

In probability theory and statistics, the binomial distribution with parameters n and p is the discrete probability distribution of the number of successes in a sequence of n independent experiments, each asking a yes–no question, and each with its own Boolean-valued outcome: success or failure. A single success/failure experiment is also called a Bernoulli trial or Bernoulli experiment, and a sequence of outcomes is called a Bernoulli process; for a single trial, i.e., n = 1, the binomial distribution is a Bernoulli distribution. The binomial distribution is the basis for the popular binomial test of statistical significance.

In mathematics, a combination is a selection of items from a set that has distinct members, such that the order of selection does not matter. For example, given three fruits, say an apple, an orange and a pear, there are three combinations of two that can be drawn from this set: an apple and a pear; an apple and an orange; or a pear and an orange. More formally, a k-combination of a set S is a subset of k distinct elements of S. So, two combinations are identical if and only if each combination has the same members. If the set has n elements, the number of k-combinations, denoted by or , is equal to the binomial coefficient

A poker player is drawing if they have a hand that is incomplete and needs further cards to become valuable. The hand itself is called a draw or drawing hand. For example, in seven-card stud, if four of a player's first five cards are all spades, but the hand is otherwise weak, they are drawing to a flush. In contrast, a made hand already has value and does not necessarily need to draw to win. A made starting hand with no help can lose to an inferior starting hand with a favorable draw. If an opponent has a made hand that will beat the player's draw, then the player is drawing dead; even if they make their desired hand, they will lose. Not only draws benefit from additional cards; many made hands can be improved by catching an out – and may have to in order to win.

In statistics, maximum likelihood estimation (MLE) is a method of estimating the parameters of an assumed probability distribution, given some observed data. This is achieved by maximizing a likelihood function so that, under the assumed statistical model, the observed data is most probable. The point in the parameter space that maximizes the likelihood function is called the maximum likelihood estimate. The logic of maximum likelihood is both intuitive and flexible, and as such the method has become a dominant means of statistical inference.

<span class="mw-page-title-main">Hypergeometric distribution</span> Discrete probability distribution

In probability theory and statistics, the hypergeometric distribution is a discrete probability distribution that describes the probability of successes in draws, without replacement, from a finite population of size that contains exactly objects with that feature, wherein each draw is either a success or a failure. In contrast, the binomial distribution describes the probability of successes in draws with replacement.

In combinatorial mathematics, the Bell numbers count the possible partitions of a set. These numbers have been studied by mathematicians since the 19th century, and their roots go back to medieval Japan. In an example of Stigler's law of eponymy, they are named after Eric Temple Bell, who wrote about them in the 1930s.

<span class="mw-page-title-main">Inclusion–exclusion principle</span> Counting technique in combinatorics

In combinatorics, a branch of mathematics, the inclusion–exclusion principle is a counting technique which generalizes the familiar method of obtaining the number of elements in the union of two finite sets; symbolically expressed as

A prior probability distribution of an uncertain quantity, often simply called the prior, is its assumed probability distribution before some evidence is taken into account. For example, the prior could be the probability distribution representing the relative proportions of voters who will vote for a particular politician in a future election. The unknown quantity may be a parameter of the model or a latent variable rather than an observable variable.

Fisher's exact test is a statistical significance test used in the analysis of contingency tables. Although in practice it is employed when sample sizes are small, it is valid for all sample sizes. It is named after its inventor, Ronald Fisher, and is one of a class of exact tests, so called because the significance of the deviation from a null hypothesis can be calculated exactly, rather than relying on an approximation that becomes exact in the limit as the sample size grows to infinity, as with many statistical tests.

Charles Anderson Worsley Anderson-Pelham, 2nd Earl of Yarborough was a British nobleman who succeeded to the Earldom of Yarborough in 1846.

In statistics, the method of moments is a method of estimation of population parameters. The same principle is used to derive higher moments like skewness and kurtosis.

In contract bridge, the principle of restricted choice states that "The play of a card which may have been selected as a choice of equal plays increases the chance that the player started with a holding in which his choice was restricted." Crucially, it helps play "in situations which used to be thought of as guesswork."

These terms are used in contract bridge, using duplicate or rubber scoring. Some of them are also used in whist, bid whist, the obsolete game auction bridge, and other trick-taking games. This glossary supplements the Glossary of card game terms.

In the card game contract bridge, a suit combination is a specific subset of the cards of one suit held respectively in declarer's and dummy's hands at the onset of play. While the ranks of the remaining cards held by the defenders can be deduced precisely, their location is unknown. Optimum suit combination play allows for all possible lies of the cards held by the defenders.

A balanced hand or balanced distribution in card games is a hand with an even distribution of suits. In the game of contract bridge, it denotes a hand of thirteen cards which contains no singleton or void and at most one doubleton. Three hand patterns are classified as truly balanced: 4-3-3-3, 4-4-3-2 and 5-3-3-2. The hand patterns 5-4-2-2 and 6-3-2-2 are generally referred to as semi-balanced.

<span class="mw-page-title-main">German tank problem</span> Mathematical problem

In the statistical theory of estimation, the German tank problem consists of estimating the maximum of a discrete uniform distribution from sampling without replacement. In simple terms, suppose there exists an unknown number of items which are sequentially numbered from 1 to N. A random sample of these items is taken and their sequence numbers observed; the problem is to estimate N from these observed numbers.

Bridge base basic, also known as BBO basic, is a bidding system for the game of bridge based on the Standard American Yellow Card (SAYC). It is simplified, suitable for beginners, and widely used in internet bridge, particularly on Bridge Base Online. It is taught in Fred Gitelman's educational software called Learn to Play Bridge that is available as a free download from the American Contract Bridge League's website.

In the card game bridge, the law or principle of vacant places is a simple method for estimating the probable location of any particular card in the two unseen hands. It can be used both to aid in a decision at the table and to derive the entire suit division probability table.

In contract bridge, the honor point count is a system for hand evaluation.

<span class="mw-page-title-main">Negative hypergeometric distribution</span>

In probability theory and statistics, the negative hypergeometric distribution describes probabilities for when sampling from a finite population without replacement in which each sample can be classified into two mutually exclusive categories like Pass/Fail or Employed/Unemployed. As random selections are made from the population, each subsequent draw decreases the population causing the probability of success to change with each draw. Unlike the standard hypergeometric distribution, which describes the number of successes in a fixed sample size, in the negative hypergeometric distribution, samples are drawn until failures have been found, and the distribution describes the probability of finding successes in such a sample. In other words, the negative hypergeometric distribution describes the likelihood of successes in a sample with exactly failures.

References

  1. 1 2 "Mathematical Tables" (Table 4). Francis, Henry G.; Truscott, Alan F.; Francis, Dorthy A., eds. (1994). The Official Encyclopedia of Bridge (5th ed.). Memphis, TN: American Contract Bridge League. p. 278. ISBN   0-943855-48-9. LCCN   96188639.
  2. Richard Pavlicek. "High Card Expectancy." link
  3. Richard Pavlicek. "Against All Odds." link
  4. Durango Bill's Bridge Probabilities and Combinatorics 1
  5. Durango Bill's Bridge Probabilities and Combinatorics 2
  6. Counting Bridge Deals, Jeroen Warmerdam

Further reading