Abstract

A computer program that uses AI planning techniques is now the world's best program for 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 quite 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 (HTN) 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.

Citations