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 () 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 gives the number of deals when various numbers of small cards are considered indistinguishable. 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. References Further reading 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.