The αμ Search Algorithm for the Game of Bridge

Abstract

is an anytime heuristic search algorithm for incomplete information games that assumes perfect information for the opponents. addresses the strategy fusion and non-locality problems encountered by Perfect Information Monte Carlo sampling. In this paper is applied to the game of Bridge.

Tasks

Reproductions