Metody Informatyki Stosowanej, no. 3/2011 (28), pages 5-18
The paper presents a review of algorithms to efficiently solve the double dummy problem in the card game of bridge.
Abstract
This paper presents a review of algorithms which allow effective solution to a double dummy problem in the card game of Bridge. From game-theory point of view, the problem is a finite, zero-sum, two-player game with perfect information. It has a huge game tree (of the order of about $13! \cdot 2^{39} \approx 3 \cdot 10^{21}$, even if we assume that the average branching factor for players to follow the suit is just 2). The proposed solutions was implemented and checked in practice. Performance analyses and comparisons to another popular program are included.