People sometimes point out that the number of possible bidding sequences in contract bridge exceeds the number of possible deals. Someone has used this fact to create a bidding system which, if used by all four players, allows anyone hearing the bidding sequence to construct the entire deal from it. I have seen the notes for such a system, though I cannot now find them: it always ended with a contract of 7HXX.
In fact, the number of possible bidding sequences does not merely exceed the number of ways that a hand of thirteen cards can be dealt validly. It also exceeds the number of possible misdeals. (I define a misdeal as a way of allocating each card of a valid bridge pack to one of the four players. I exclude cases in which the pack is defective, and those in which one or more cards end up held by none of the players.) The purpose of this page is to present a bidding system which, if followed by all four players, even when there has been a misdeal, allows anyone hearing the bidding sequence to construct the entire deal or misdeal from it.
The system assigns an order to the cards, and finds the cards in this order. Any order will do, but we shall use the order C2, D2, H2, S2, C3, ... SA.
Initially, a player bids 1C if he holds the C2, otherwise passes. Once the C2 has been placed, the bidding proceeds in "steps". Each step takes the bidding up two levels (e.g. from 2C to 2H, or from 4NT to 5D), and places the next three cards. Thus there are 17 steps, which are just sufficient to place the remaining 51 cards.
A step starts with the player after the final bid of the previous step, or after the 1C bid; and ends with the second bid of the step. For the duration of the step, the first player is labelled "1", the second player "2", etc. They bid the step according to the diagram below.
In diagram, black numbers like indicate the player who is next to act. Red numbers like indicate the player who is known to hold some card. Thus means that player 1 holds the first card (first to be placed in this step) and player 4 holds the second. The lines connecting the circles are bids, passes, doubles, and redoubles, as shown in the key at the bottom left of the diagram.
The circles indicate the player who is next to call: means that player 3 is to call. Terminal nodes show, in red, where the three cards placed in the step are: places the first card with player 4, the second with player 2, and the third with player 3.
Some terminal nodes are tinted pink like this:
. These indicate that only two
cards have been placed, but there is a level of bidding left to locate
the third one. This is then easily done:
The next player bids if he holds the card; else he passes and
the next player bids if he holds the card; else he passes and
the next player bids if he holds the card; else he doubles and
the next player, who must hold the card, bids.
The bidding diagram has (I hope) these properties:
There is plenty of slack in this system. I suspect it is possible to devise a system like this which can also cope with cards misdealt to no player. But arranging to place three cards (each in some player's hand or on the floor) in each two levels of bidding won't quite do; we cannot guarantee to place the 52nd card in the initial 1C bid and any final doubles and redoubles.
Possible deals | 52!/(13!)^^4 | 5.3*10^28 | 53,644,737,765,488,792,839,237,440,000 |
Possible deals + misdeals | 4^52 | 2.0*10^31 | 20,282,409,603,651,670,423,947,251,286,016 |
Possible deals + misdeals, if some of the cards may be on the floor instead of in any player's hand | 5^52 | 2.2*10^36 | 2,220,446,049,250,313,080,847,263,336,181,640,625 |
Possible bidding sequences | 28*(22^34) | 1.2*10^47 | 122,893,575,331,256,561,160,221,384,015,627,127,210,253,484,032 |