Search techniques for the game of double-dummy bridge

The game of Double-Dummy Bridge can be viewed cis a two-team, perfect information game. In theory, the solution to this game can be found by exhaustively examining every possible play of the game. In practice, a computer is not able to solve such a problem due to time constraints. We develop, compare, and analyze techniques implemented in order to solve a Double-Dummy Bridge game without exhaustively examining every possible line of play of the game. Analysis of the techniques allows us to distinguish the performance of each of the techniques as applied to the Double-Dummy Bridge game. The techniques implemented here are valuable steps toward realizing a perfect computer Double-Dummy Bridge player.