T. Otawa and T. Uehara (Japan)
Intelligent Agents, Computer Bridge, Imperfect Information Game, Game-tree Search.
The Contract Bridge is an imperfect information game, but most Computer Bridges play cards assuming the best play by opponents. So, it is difficult for Computer Bridges to take advantage of mistakes made by less-than-perfect op ponents. This paper proposes a game-tree search based on a multi-player model of Bridge. The algorithm is able to se lect advanced plays deceiving the opponent or preventing the partner’s mistakes. We implement the parallel game tree search with this model and test it on 64 processors. Typical exercises on deceptive plays and partnerships are solved successfully.
Important Links:
Go Back
