GIB: Imperfect Information in a Computationally Challenging Game

This paper investigates the problems arising in the construction of a program to play the game of contract bridge. These problems include both the difficulty of solving the game's perfect information variant, and techniques needed to address the fact that bridge is not, in fact, a perfect information game. GIB, the program being described, involves five separate technical advances: partition search, the practical application of Monte Carlo techniques to realistic problems, a focus on achievable sets to solve problems inherent in the Monte Carlo approach, an extension of alpha-beta pruning from total orders to arbitrary distributive lattices, and the use of squeaky wheel optimization to find approximately optimal solutions to cardplay problems. GIB is currently believed to be of approximately expert caliber, and is currently the strongest computer bridge program in the world.

[1]  Donald E. Eastlake,et al.  The Greenblatt chess program , 1967, AFIPS '67 (Fall).

[2]  G. M. Adelson-Velskiy,et al.  Some Methods of Controlling the Tree Search in Chess Programs , 1975, Artif. Intell..

[3]  Gerald J. Sussman,et al.  Forward Reasoning and Dependency-Directed Backtracking in a System for Computer-Aided Circuit Analysis , 1976, Artif. Intell..

[4]  G. Grätzer.  General Lattice Theory , 1978 .

[5]  Judea Pearl,et al.  Asymptotic Properties of Minimax Trees and Game-Searching Procedures , 1980, Artif. Intell..

[6]  David Wilkins,et al.  Using Patterns and Plans in Chess , 1980, Artif. Intell..

[7]  Judea Pearl,et al.  The solution for the branching factor of the alpha-beta pruning algorithm and its optimality , 1982, CACM.

[8]  T. A. Marsland,et al.  A Review of Game-Tree Pruning , 1986, J. Int. Comput. Games Assoc..

[9]  David A. McAllester.  Conspiracy Numbers for Min-Max Search , 1988, Artif. Intell..

[10]  Leon Sterling,et al.  PYTHON: An Expert Squeezer , 1990, J. Log. Program..

[11]  Matthew L. Ginsberg,et al.  Iterative Broadening , 1990, Artif. Intell..

[12]  Matthew L. Ginsberg,et al.  Dynamic Backtracking , 1993, J. Artif. Intell. Res..

[13]  Avi Pfeffer,et al.  Generating and Solving Imperfect Information Games , 1995, IJCAI.

[14]  Daniel P. Miranker,et al.  A Complexity Analysis of Space-Bounded Learning Algorithms for the Constraint Satisfaction Problem , 1996, AAAI/IAAI, Vol. 1.

[15]  Jonathan Schaeffer,et al.  Exploiting Graph Properties of Game Trees , 1996, AAAI/IAAI, Vol. 1.

[16]  Dana S. Nau,et al.  Total-Order Multi-Agent Task-Network Planning for Contract Bridge , 1996, AAAI/IAAI, Vol. 1.

[17]  Jonathan Schaeffer,et al.  One jump ahead - challenging human supremacy in checkers , 1997, J. Int. Comput. Games Assoc..

[18]  Ian Frank,et al.  Finding Optimal Strategies for Imperfect Information Games , 1998, AAAI/IAAI.

[19]  Ian Frank,et al.  Search in Games with Incomplete Information: A Case Study Using Bridge Card Play , 1998, Artif. Intell..

[20]  Ian Frank,et al.  Search and planning under incomplete information - a study using bridge card play , 1998, Distinguished dissertations.

[21]  Jonathan Schaeffer,et al.  Opponent Modeling in Poker , 1998, AAAI/IAAI.

[22]  David Joslin,et al.  "Squeaky Wheel" Optimization , 1998, AAAI/IAAI.

[23]  Jørn Lind-Nielsen,et al.  BuDDy : A binary decision diagram package. , 1999 .

[24]  Alan Bundy,et al.  Combining Knowledge and Search to Solve Single-Suit Bridge , 2000, AAAI/IAAI.

[25]  Matthew L. Ginsberg,et al.  Alpha-Beta Pruning Under Partial Orders , 2002 .