{"id":7,"date":"2023-04-14T13:58:56","date_gmt":"2023-04-14T13:58:56","guid":{"rendered":"https:\/\/sites.ohio.edu\/walkerc3\/bridgemath\/"},"modified":"2023-04-14T13:58:56","modified_gmt":"2023-04-14T13:58:56","slug":"bridgemath","status":"publish","type":"page","link":"https:\/\/sites.ohio.edu\/walkerc3\/bridgemath\/","title":{"rendered":"bridgemath"},"content":{"rendered":"

<\/p>\n

Understanding the Math Behind Bridge By Jim Schultz<\/p>\n

\u201cNothing is more terrible than ignorance in action.\u201d — Goethe<\/p>\n

<\/p>\n

If you\u2019re the kind of bridge player who is satisfied with memorizing various probabilities like the probability of dropping a singleton king under your ace, this article it not <\/i>for you. But if you\u2019re the kind of person who enjoys understanding <\/i>how these probabilities are determined, then read on. The focus is on building a better understanding of bridge (and mathematics) rather than on making you a better bridge player, but don\u2019t be surprised if a deeper understanding does help you become a better player.<\/p>\n

<\/p>\n

Bridge columns and articles often cite probabilities to determine the best line of play. For example, in a newspaper column in which South held \uf0a8<\/span>AJ75 and dummy held \uf0a8<\/span>Q10984, noted bridge expert Phillip Alder wrote, \u201cWest will have all four diamonds only 4.8 percent of the time. And when South starts with his diamond ace he will drop the singleton king 12.4 percent of the time.\u201d Have you ever wondered where these numbers come from? You will now see how to find such numbers, with all the necessary math beyond ordinary arithmetic, as well as many useful numbers in computing probabilities and hints on how to use popular calculators to find any others you might wish to know to better enjoy the game. If you have the ability to play bridge, chances are you have the ability to understand how these probabilities are determined.<\/p>\n

<\/p>\n

Combinations, the Basis for Understanding<\/h1>\n

<\/p>\n

When playing bridge, you are constantly counting things, like how many trump are out. It should then be no surprise that counting is an essential part of determining your chances in bridge.<\/p>\n

<\/p>\n

The main underlying idea is the Fundamental Principle of Counting, illustrated in this example:<\/p>\n

<\/p>\n

Example 1. How many honors are there?<\/span><\/h1>\n

Solution: Each of the 4 suits contains 5 honors (A, K, Q, J, 10), so there are 4 x 5 = 20 honors.<\/p>\n

<\/p>\n

This can be generalized in the following way:<\/p>\n

<\/p>\n

Fundamental Principle of Counting. <\/b>If a first thing can be done in m <\/i>ways and if for each of these ways <\/i>a second thing can be done in n <\/i>ways, then the two things can be done in m x n <\/i>ways.<\/p>\n

<\/p>\n

Example 2. You are defending and partner leads the ace and then the king of spades. In how many orders can you choose to follow suit from a hand containing three spades: 9, 8, and 5?<\/span><\/h1>\n

Solution: There are 3 ways to follow to the first trick. For each of these 3 ways there are 2 ways to play your next spade. By the Fundamental Principle of Counting there are 3 x 2 = 6 ways for you to play.<\/p>\n

Here is a complete list which confirms this: 98, 95, 89, 85, 59, 58. It is having 6 ways to play that gives you the flexibility to signal attitude and\/or count.<\/p>\n

<\/p>\n

Example 3. In the previous example, how many orders are there to play your three different spades? Solution: From Example 2, there are 6 ways to play your first 2 spades. For each of these there is 1 way to play your remaining spade, so there are 3 x 2 x 1 = 6 ways. Note that once you play the first two spades you have only one choice in playing the third spade, so the answer is the same as in the previous example.<\/span><\/h1>\n

Examples 2 and 3 involved problems where order was important. Counting situations where order is not important<\/i>, including the examples mentioned at the beginning, involve what are called combinations<\/b>.<\/p>\n

<\/p>\n

Example 4. How many doubletons are there in spades? (Note here that AK is considered the same as<\/span><\/h1>\n

KA, since order doesn\u2019t matter.)<\/p>\n

Solution: As before there are 13 ways to choose the first spade, and for each of these there are 12 ways to choose the second spade. But since doubleton ace-king and each other doubleton is counted twice,<\/p>\n

\"image\"<\/span><\/p>\n

you need to divide by 2, so the answer is 13 <\/span>x<\/span>12 <\/span>= 78.<\/p>\n

2<\/p>\n

(This is not unlike seeing only the legs of a number of people standing behind a curtain, when you could find the number of people by counting the legs and dividing by 2.)<\/p>\n

<\/p>\n

\"image\"<\/span><\/p>\n

It will be convenient to represent the number of combinations of 13 things taken 2 at a time by C(13, 2). This lets us express the computations of Example 4 as C(13, 2) = 13 <\/span>x<\/span>12 <\/span>. To obtain a more<\/p>\n

2<\/p>\n

general rule which works when more numbers are involved, you can think of finding C(13, 2) this way:<\/p>\n

<\/p>\n

Step 1: Using the Fundamental Principle of Counting, the number of ways to choose 2 cards from 13<\/p>\n

when order matters is 13 x 12.<\/span><\/p>\n

<\/p>\n

Step 2: For each choice the same 2 cards can be arranged in 2 x 1 ways (meaning each combination of two cards has been counted twice), so divide by 2 x 1:<\/p>\n

\"image\"<\/span><\/p>\n

C(13, 2) = 13 <\/span>x<\/span>12 <\/span>= 78.<\/p>\n

2 x<\/i>1<\/p>\n

The next examples illustrate this more general approach when more than 2 cards are chosen.<\/p>\n

<\/p>\n

Example 5. Find the number of combinations of 3 club honors.<\/span><\/h1>\n

Solution: There are 5 club honors (A, K, Q, J, 10) from which to choose 3.<\/p>\n

Step 1: The number of ways to choose 3 cards from 5 when order matters is 5 x 4 x 3. Step 2: Divide by 3 x 2 x 1, the number of ways of rearranging the same 3 cards:<\/p>\n

C(5, 3) =<\/p>\n

5 x <\/i>4x <\/i>3 = 10.<\/span><\/p>\n

\"image\"<\/span><\/p>\n

3 x <\/i>2 x<\/i>1<\/p>\n

Here is a complete list of the 10 combinations: AKQ, AKJ,AK10, AQJ, AQ10, AJ10, KQJ, KQ10, KJ10, QJ10. Note that since you are not concerned with order, since AKQ, AQK, KAQ, KQA, QAK, and QKA are merely 6 different ways of writing the same combination.<\/p>\n

<\/p>\n

Example 6. Find the number of 5-card heart holdings. Solution: This involves finding C(13, 5).<\/span><\/h1>\n

Step 1: The number of ways to choose 5 cards from 13 when order matters is 13 x 12 x 11 x 10 x 9.<\/p>\n

Step 2: Divide by 5 x 4 x 3 x 2 x 1, the number of ways of rearranging the same 5 cards:<\/p>\n

\"image\"<\/span><\/p>\n

C(13, 5) = <\/span>13 x<\/i>12 x<\/i>11 x<\/i>10 x <\/i>9 = 1287<\/span><\/p>\n

5 x <\/i>4 x <\/i>3 x <\/i>2 x<\/i>1<\/p>\n

<\/p>\n

A convenient shorthand for 5 x 4 x 3 x 2 x 1 is \u201cfive factorial\u201d, written 5!. Similarly,<\/p>\n

13 x 12 x 11 x 10 x 9 looks like 13!, with all the factors from 8 on down cancelled out. This enables us to write 13 x 12 x 11 x 10 x 9 as 13! \/ 8!<\/p>\n

This means that C(13, 5) =<\/p>\n

13!<\/p>\n

\"image\"<\/span><\/p>\n

5! 8!<\/p>\n

<\/p>\n

The computations of Example 4 and 5 can be written as<\/p>\n

C(13, 2) =<\/p>\n

13!<\/p>\n

\"image\"<\/span><\/p>\n

2! 11!<\/p>\n

and C(5, 3) =<\/p>\n

5!<\/p>\n

\"image\"<\/span><\/p>\n

3! 2!<\/p>\n

<\/p>\n

In general, C(n, r) =<\/p>\n

n!<\/span><\/p>\n

\"image\"<\/span><\/p>\n

r! (<\/span>n \uf02d<\/span> <\/span>r)!<\/span><\/p>\n

<\/p>\n

Example 7. How many bridge hands are possible?<\/span><\/h1>\n

Solution: A bridge hand consists of 13 cards chosen from 52, so<\/p>\n

C(52, 13) =<\/p>\n

52!<\/p>\n

\"image\"<\/span><\/p>\n

13! 39!<\/p>\n

= <\/span>52 x <\/i>51 x <\/i>50 x <\/i>49 x <\/i>48 x <\/i>47 x <\/i>46 x <\/i>45 x <\/i>44 x <\/i>43 x <\/i>42 x <\/i>41 x <\/i>40 = 635,013,559,600, or about<\/span><\/p>\n

\"image\"<\/span><\/p>\n

13 x<\/i>12 x<\/i>11 x<\/i>10 x <\/i>9 x <\/i>8 x <\/i>7 x <\/i>6 x <\/i>5 x <\/i>4 x <\/i>3 x <\/i>2 x<\/i>1<\/p>\n

635 billion. (If you dealt one hand per minute 24 hours a day 7 days a week it would take over a million years!)<\/p>\n

Here is where a good calculator comes in handy! For example, on many Texas Instruments graphing calculators <\/span>MATH<\/span> <\/span>PRB <\/span>3<\/span> gives C(n, r), so these key strokes will compute C(52, 13):<\/span><\/p>\n

<\/p>\n

52 <\/span>MATH<\/span> <\/span>PRB <\/span>3<\/span> 13 <\/span>ENTER<\/span>.<\/span><\/p>\n

<\/p>\n

The answer may appear as 6.350135596E11, which is scientific notation for 635,013,559,600. The E11 at the end of the number means multiply by 1011, or in other words \u201cmove the decimal point 11 places to the right\u201d.<\/p>\n

<\/p>\n

For your reference, values of some of the most commonly occurring combinations generated by an Excel spreadsheet using the built-in function COMBIN, are given below. For example, 78, the value of C(13, 2) which appears across from 13 and under 2, was computed using the Excel formula<\/p>\n

=combin(13, 2).<\/p>\n

r<\/h1>\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n
\n

n<\/p>\n<\/td>\n

\n

0<\/p>\n<\/td>\n

\n

1<\/p>\n<\/td>\n

\n

2<\/p>\n<\/td>\n

\n

3<\/p>\n<\/td>\n

\n

4<\/p>\n<\/td>\n

\n

5<\/p>\n<\/td>\n

\n

6<\/p>\n<\/td>\n

\n

7<\/p>\n<\/td>\n

\n

8<\/p>\n<\/td>\n

\n

9<\/p>\n<\/td>\n

\n

10<\/p>\n<\/td>\n

\n

11<\/p>\n<\/td>\n

\n

12<\/p>\n<\/td>\n

\n

13<\/p>\n<\/td>\n<\/tr>\n

\n

1<\/p>\n<\/td>\n

\n

1<\/p>\n<\/td>\n

\n

1<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n<\/tr>\n

\n

2<\/p>\n<\/td>\n

\n

1<\/p>\n<\/td>\n

\n

2<\/p>\n<\/td>\n

\n

1<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n<\/tr>\n

\n

3<\/p>\n<\/td>\n

\n

1<\/p>\n<\/td>\n

\n

3<\/p>\n<\/td>\n

\n

3<\/p>\n<\/td>\n

\n

1<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n<\/tr>\n

\n

4<\/p>\n<\/td>\n

\n

1<\/p>\n<\/td>\n

\n

4<\/p>\n<\/td>\n

\n

6<\/p>\n<\/td>\n

\n

4<\/p>\n<\/td>\n

\n

1<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n<\/tr>\n

\n

5<\/p>\n<\/td>\n

\n

1<\/p>\n<\/td>\n

\n

5<\/p>\n<\/td>\n

\n

10<\/p>\n<\/td>\n

\n

10<\/p>\n<\/td>\n

\n

5<\/p>\n<\/td>\n

\n

1<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n<\/tr>\n

\n

6<\/p>\n<\/td>\n

\n

1<\/p>\n<\/td>\n

\n

6<\/p>\n<\/td>\n

\n

15<\/p>\n<\/td>\n

\n

20<\/p>\n<\/td>\n

\n

15<\/p>\n<\/td>\n

\n

6<\/p>\n<\/td>\n

\n

1<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n<\/tr>\n

\n

7<\/p>\n<\/td>\n

\n

1<\/p>\n<\/td>\n

\n

7<\/p>\n<\/td>\n

\n

21<\/p>\n<\/td>\n

\n

35<\/p>\n<\/td>\n

\n

35<\/p>\n<\/td>\n

\n

21<\/p>\n<\/td>\n

\n

7<\/p>\n<\/td>\n

\n

1<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n<\/tr>\n

\n

8<\/p>\n<\/td>\n

\n

1<\/p>\n<\/td>\n

\n

8<\/p>\n<\/td>\n

\n

28<\/p>\n<\/td>\n

\n

56<\/p>\n<\/td>\n

\n

70<\/p>\n<\/td>\n

\n

56<\/p>\n<\/td>\n

\n

28<\/p>\n<\/td>\n

\n

8<\/p>\n<\/td>\n

\n

1<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n<\/tr>\n

\n

9<\/p>\n<\/td>\n

\n

1<\/p>\n<\/td>\n

\n

9<\/p>\n<\/td>\n

\n

36<\/p>\n<\/td>\n

\n

84<\/p>\n<\/td>\n

\n

126<\/p>\n<\/td>\n

\n

126<\/p>\n<\/td>\n

\n

84<\/p>\n<\/td>\n

\n

36<\/p>\n<\/td>\n

\n

9<\/p>\n<\/td>\n

\n

1<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n<\/tr>\n

\n

10<\/p>\n<\/td>\n

\n

1<\/p>\n<\/td>\n

\n

10<\/p>\n<\/td>\n

\n

45<\/p>\n<\/td>\n

\n

120<\/p>\n<\/td>\n

\n

210<\/p>\n<\/td>\n

\n

252<\/p>\n<\/td>\n

\n

210<\/p>\n<\/td>\n

\n

120<\/p>\n<\/td>\n

\n

45<\/p>\n<\/td>\n

\n

10<\/p>\n<\/td>\n

\n

1<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n<\/tr>\n

\n

11<\/p>\n<\/td>\n

\n

1<\/p>\n<\/td>\n

\n

11<\/p>\n<\/td>\n

\n

55<\/p>\n<\/td>\n

\n

165<\/p>\n<\/td>\n

\n

330<\/p>\n<\/td>\n

\n

462<\/p>\n<\/td>\n

\n

462<\/p>\n<\/td>\n

\n

330<\/p>\n<\/td>\n

\n

165<\/p>\n<\/td>\n

\n

55<\/p>\n<\/td>\n

\n

11<\/p>\n<\/td>\n

\n

1<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n<\/tr>\n

\n

12<\/p>\n<\/td>\n

\n

1<\/p>\n<\/td>\n

\n

12<\/p>\n<\/td>\n

\n

66<\/p>\n<\/td>\n

\n

220<\/p>\n<\/td>\n

\n

495<\/p>\n<\/td>\n

\n

792<\/p>\n<\/td>\n

\n

924<\/p>\n<\/td>\n

\n

792<\/p>\n<\/td>\n

\n

495<\/p>\n<\/td>\n

\n

220<\/p>\n<\/td>\n

\n

66<\/p>\n<\/td>\n

\n

12<\/p>\n<\/td>\n

\n

1<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n<\/tr>\n

\n

13<\/p>\n<\/td>\n

\n

1<\/p>\n<\/td>\n

\n

13<\/p>\n<\/td>\n

\n

78<\/p>\n<\/td>\n

\n

286<\/p>\n<\/td>\n

\n

715<\/p>\n<\/td>\n

\n

1287<\/p>\n<\/td>\n

\n

1716<\/p>\n<\/td>\n

\n

1716<\/p>\n<\/td>\n

\n

1287<\/p>\n<\/td>\n

\n

715<\/p>\n<\/td>\n

\n

286<\/p>\n<\/td>\n

\n

78<\/p>\n<\/td>\n

\n

13<\/p>\n<\/td>\n

\n

1<\/p>\n<\/td>\n<\/tr>\n<\/table>\n

C(n, r) for n = 1 to 13<\/p>\n

<\/p>\n

This pattern of numbers is known to mathematicians and many middle school students as Pascal\u2019s triangle<\/b>. It has many interesting properties. Some of the most useful to this bridge theme are discussed next.<\/p>\n

<\/p>\n

Example 8. <\/b>How many ways are there to choose none <\/i>of the 13 clubs so you have a void in clubs? Solution: There is only one way to do this: Don\u2019t choose <\/i>the ace, don\u2019t choose <\/i>the king, don\u2019t choose <\/i>the queen, etc. <\/i>For each card, there is only 1 choice that can be made: not <\/i>to choose that card. Using the notation for combinations, C(13, 0) = 1.<\/p>\n

<\/p>\n

Similarly C(52, 0) = 1, and in general, C(n, 0) = 1 for all values of n.<\/p>\n

<\/p>\n

It is also clear that there is symmetry in the table. For example, C(5, 1) = C(5, 4). In terms of cards, this is because the number of ways to choose which 1 of 5 cards to include, represented by<\/p>\n

C(5, 1), is the same as the number of ways to choose which 1 of 5 cards not <\/i>to include, represented by C(5, 4). In much the same way C(5, 2) = C(5, 3), because the number of ways to choose which 2 of 5 cards to include, represented by C(5, 2), is the same as the number of ways to choose which 2 of 5 cards not <\/i>to include, represented by C(5, 3).<\/p>\n

You may wish to look for other interesting properties, such as how to predict one row from the previous one.<\/p>\n

Here are a few more combinations that will be useful: For example, if you are declarer you can see all but 26 cards, so the number of possible hands for East chosen from the remaining cards is<\/p>\n

C(26, 13), which from the chart is 10,400,600.<\/p>\n

<\/p>\n\n\n\n\n\n\n
\n

<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n

\n

r<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n<\/tr>\n

\n

n<\/p>\n<\/td>\n

\n

0<\/p>\n<\/td>\n

\n

13<\/p>\n<\/td>\n

\n

26<\/p>\n<\/td>\n

\n

39<\/p>\n<\/td>\n

\n

52<\/p>\n<\/td>\n<\/tr>\n

\n

26<\/p>\n<\/td>\n

\n

1<\/p>\n<\/td>\n

\n

10,400,600<\/p>\n<\/td>\n

\n

1<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n<\/tr>\n

\n

39<\/p>\n<\/td>\n

\n

1<\/p>\n<\/td>\n

\n

8,122,425,444<\/p>\n<\/td>\n

\n

8,122,425,444<\/p>\n<\/td>\n

\n

1<\/p>\n<\/td>\n

\n

<\/p>\n<\/td>\n<\/tr>\n

\n

52<\/p>\n<\/td>\n

\n

1<\/p>\n<\/td>\n

\n

635,013,559,600<\/p>\n<\/td>\n

\n

495,918,532,948,104<\/p>\n<\/td>\n

\n

635,013,559,600<\/p>\n<\/td>\n

\n

1<\/p>\n<\/td>\n<\/tr>\n<\/table>\n

<\/p>\n

Example 9. How many hands have a void in clubs?<\/span><\/h1>\n

Solution. From Example 8 there is C(13, 0) = 1 way to choose the clubs. All 13 cards in the hand must be chosen from the other 39 cards, or C(39, 13) ways. Using the chart above or a calculator this is 8,122,425,444 ways. So the answer is 1 x 8,122,425,444 = 8,122,425,444.<\/p>\n

<\/p>\n

Of course, the number of ways to have a void is the same for any suit, but it\u2019s not quite true that there is a total of 4 x 8,122,425,444 hands which are voids. This is because some hands may have 2 or even 3 voids, so the same hand will be counted more than once. Taking this into account, the actual number of hands with at least one void is 32,427,298,180. (For experts, this number is 4C(39, 13) \u2013 6C(26, 13) + 4.)<\/p>\n

<\/p>\n

In the same way you can find the number of hands with any particular distribution.<\/p>\n

<\/p>\n

Probabilities, Clues to Making the Best Play<\/h1>\n

<\/p>\n

Computing probabilities simply involves comparing particular outcomes with equally likely <\/i>possible outcomes. Here equally likely <\/i>is an important part of the definition. For example, it would be incorrect to say that the probability of being first in a field of 48 teams in a major tournament is \u00bd, because either you come in first or you don\u2019t. For most of us, these are not equally likely events!<\/p>\n

<\/p>\n

The probability <\/b>of an event occurring is the number of ways the event can occur divided by the number of equally likely <\/i>possible outcomes.<\/p>\n

<\/p>\n

Example 10. Find the probability of having a void in clubs.<\/span><\/h1>\n

Solution: From Example 9, the number of ways this can occur is 8,122,425,444, and from Example 7 the number of possible bridge hands is 635,013,559,600. Thus the probability of a void in clubs is 8,122,425,444 \/ 635,013,559,600 = .0127909, or about 1.3%.<\/p>\n

<\/p>\n

How to open a 13-point hand with exactly 4 spades, 4 hearts, 3 diamonds, and 2 clubs is often a matter of considerable debate as not bidding a 4-card major forces bidding a 3- or 2-card suit. How often does this 4-4-3-2 distribution occur?<\/p>\n

Example 11. Find the probability of having a hand with 4 spades, 4 hearts, 3 diamonds, and 2 clubs. Solution: There are C(13,4) = 715 ways to choose the spades. For each of these, there are C(13,4) = 715 ways to choose the hearts, C(13, 3) = 286 ways to choose the diamonds, and finally C(13, 2) = 78 ways to choose the clubs. (The numbers 715, 286, and 78 can be found in row 13 of the first chart.) The number of such hands is 715 x 715 x 286 x 78 = 11,404,407,300, so the probability of having such a hand is 11,404,407,300 \/ 635,013,559,600 = .0179593, or about 1.8%.<\/span><\/h1>\n

<\/p>\n

Such large numbers can be hard to read. It may actually be more meaningful to show the solutions to Examples 10 and 11 this way:<\/p>\n

<\/p>\n

\"image\"<\/span><\/p>\n

P(void in clubs) = <\/span>C<\/i>(13, 0) x C<\/i>(39,13) , and<\/span><\/p>\n

C(52,13)<\/span><\/p>\n

<\/p>\n

P(4S-4H-3D-2C distribution) =<\/p>\n

C(13, 4) <\/span>x C(13, 4) <\/span>x C(13, 3) <\/span>x C(13, 2) <\/span>.<\/span><\/p>\n

\"image\"<\/span><\/p>\n

C(52,13)<\/span><\/p>\n

<\/p>\n

Example 12. Find the probability of holding any 4-4-3-2 distribution.<\/span><\/h1>\n

Solution: There are 4 suits to pick for the doubleton. For each of these there are 3 ways to pick the 3- card suit. For each of these there is only 1 way to pick the remaining two suits, so there are 4 x 3 x 1 = 12 ways to pick the suits. Thus the probability is 12 times the answer computed in Example 11, which is 21.6%.<\/p>\n

<\/p>\n

You are now able to compute the numbers in the opening paragraph:<\/p>\n

<\/p>\n

Example 13. <\/b>If South holds \uf0a8<\/span>AJ75 and dummy holds \uf0a8<\/span>Q10984, find the probability West will have all four diamonds.<\/p>\n

Solution: Declarer\u2019s combined hands consist of 9 diamonds and 17 other cards, so the defenders\u2019 combined hands consist of 4 diamonds and 39 \u2013 17 = 22 other cards. There is C(4, 4) = 1 way to choose the diamonds West holds. (Choose them all.) And there are C(22, 9) = 497,420 ways to choose West\u2019s remaining cards. This is out of C(26, 13) = 10,400,600 possible hands that West could have using the unseen cards. Thus, the probability West will have all 4 diamonds is<\/p>\n

\"image\"<\/span><\/p>\n

\"image\"<\/span><\/p>\n

P = <\/span>C<\/i>(4, 4) x C<\/i>(22, 9) = <\/span>1 x <\/i>497,420<\/p>\n

= 4.8%<\/p>\n

C(26,13) 10,400,600<\/span><\/p>\n

<\/p>\n

Example 14. <\/b>If South holds \uf0a8<\/span>AJ75 and dummy holds \uf0a8<\/span>Q10984, find the probability West or East will have a singleton \uf0a8<\/span>K, which will fall if declarer leads \uf0a8<\/span>A.<\/p>\n

Solution: First find the probability that West has the singleton \uf0a8<\/span>K. This is similar to the previous example, except that this time there is C<\/i>(1,1) = 1 way to choose the \uf0a8<\/span>K, C<\/i>(3,0) = 1 way to choose the other three hearts (don\u2019t choose any of them), and C(22, 12) = 646,646 ways to choose West\u2019s remaining 12 cards, so<\/p>\n

\ud835\udc36(1,1) \ud835\udc65 \ud835\udc36(3,0) \ud835\udc65 \ud835\udc36(22,12)<\/p>\n

\"image\"<\/span><\/p>\n

P = =<\/p>\n

\ud835\udc36(26,13)<\/p>\n

1 \ud835\udc65 1 \ud835\udc65 646,646<\/p>\n

\"image\"<\/span><\/p>\n

10,400,600<\/p>\n

<\/p>\n

= 6.2%.<\/p>\n

By the same reasoning, the probability East has the singleton \uf0a8<\/span>K is also 6.2%. Since these are mutually exclusive, the probabilities can be added to give 12.4%.<\/p>\n

<\/p>\n

The examples presented here can serve as a template for computing new probabilities which may arise. Understanding the math behind bridge can allow people to enjoy the game in a new way. It even may provide an appreciation for why some of the math you learned in school and never used since is actually useful!<\/p>\n

<\/p>\n

Phillip Alder\u2019s web site: https:\/\/<\/a>www.bridgeforeveryone.com\/<\/a><\/p>\n

<\/body><\/p>\n","protected":false},"excerpt":{"rendered":"

Understanding the Math Behind Bridge By Jim Schultz \u201cNothing is more terrible than ignorance in action.\u201d — Goethe If you\u2019re the kind of bridge player who is satisfied with memorizing various probabilities like the probability of dropping a singleton king under your ace, this article it not for you. But if you\u2019re the kind of […]<\/p>\n","protected":false},"author":2,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-7","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/sites.ohio.edu\/walkerc3\/wp-json\/wp\/v2\/pages\/7","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/sites.ohio.edu\/walkerc3\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/sites.ohio.edu\/walkerc3\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/sites.ohio.edu\/walkerc3\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/sites.ohio.edu\/walkerc3\/wp-json\/wp\/v2\/comments?post=7"}],"version-history":[{"count":1,"href":"https:\/\/sites.ohio.edu\/walkerc3\/wp-json\/wp\/v2\/pages\/7\/revisions"}],"predecessor-version":[{"id":12,"href":"https:\/\/sites.ohio.edu\/walkerc3\/wp-json\/wp\/v2\/pages\/7\/revisions\/12"}],"wp:attachment":[{"href":"https:\/\/sites.ohio.edu\/walkerc3\/wp-json\/wp\/v2\/media?parent=7"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}