Computer Bridge - A Big Win for AI Planning

A computer program that uses AI planning techniques is now the world champion computer program in the game of Contract Bridge. As reported in The New York Times and The Washington Post, this program -- a new version of Great Game Products' BRIDGE BARON program -- won the Baron Barclay World Bridge Computer Challenge, an international competition hosted in July 1997 by the American Contract Bridge League. It is well known that the game tree search techniques used in computer programs for games such as Chess and Checkers work differently from how humans think about such games. In contrast, our new version of the BRIDGE BARON emulates the way in which a human might plan declarer play in Bridge by using an adaptation of hierarchical task network planning. This article gives an overview of the planning techniques that we have incorporated into the BRIDGE BARON and discusses what the program's victory signifies for research on AI planning and game playing.

[1]  Ioannis Minis,et al.  Hierarchical Task-Network Planning for Process Planning for Manufacture of Microwave Modules" , 1996 .

[2]  Austin Tate,et al.  Generating Project Networks , 1977, IJCAI.

[3]  Dana Nau,et al.  Integrating electrical and mechanical design and process planning , 1997 .

[4]  James A. Hendler,et al.  Plan-Refinement Strategies and Search-Space Size , 1997, ECP.

[5]  James A. Hendler,et al.  UMCP: A Sound and Complete Procedure for Hierarchical Task-network Planning , 1994, AIPS.

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

[7]  Earl D. Sacerdoti,et al.  Planning in a Hierarchy of Abstraction Spaces , 1974, IJCAI.

[8]  Stephen J. J. Smith.  Task-network planning using total-order forward search, and applications to bridge and to microwave module manufacture , 1997 .

[9]  James A. Hendler,et al.  Commitment Strategies in Hierarchical Task Network Planning , 1996, AAAI/IAAI, Vol. 1.

[10]  Austin Tate,et al.  O-Plan: control in the open planning architecture , 1986 .

[11]  Matthew L. Ginsberg,et al.  Partition Search , 1996, AAAI/IAAI, Vol. 1.

[12]  Dana S. Nau,et al.  Complexity results for hierarchical task-network planning , 1996 .

[13]  Jonathan Schaeffer,et al.  Games: Planning and Learning , 1994, J. Int. Comput. Games Assoc..

[14]  David E. Wilkins,et al.  Applying an AI Planner to Military Operations Planning , 1993 .

[15]  Richard E. Korf,et al.  Best-First Minimax Search: Othello Results , 1994, AAAI.

[16]  Earl David Sacerdoti,et al.  A Structure for Plans and Behavior , 1977 .

[17]  Dana S. Nau,et al.  A PLANNING APPROACH TO DECLARER PLAY IN CONTRACT BRIDGE , 1995, Comput. Intell..

[18]  James A. Hendler,et al.  HTN Planning: Complexity and Expressivity , 1994, AAAI.

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

[20]  John Mark Agosta.  Constraining Influence Diagram Structure by Generative Planning: An Application to the Optimization of Oil Spill Response , 1996, UAI.