The αμ Search Algorithm for the Game of Bridge

11/18/2019
by   Tristan Cazenave, et al.
0

αμ 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.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset