The αμ Search Algorithm for the Game of Bridge

Add code
Nov 18, 2019
Tristan Cazenave, Véronique Ventos
Figure 1 for The αμ Search Algorithm for the Game of Bridge
Figure 2 for The αμ Search Algorithm for the Game of Bridge
Figure 3 for The αμ Search Algorithm for the Game of Bridge
Figure 4 for The αμ Search Algorithm for the Game of Bridge

Share this with someone who'll enjoy it:

Twitter IconFacebook IconLinkedin IconWhatsapp IconMessenger Icon

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

View paper onarxiv icon

Share this with someone who'll enjoy it:

Twitter IconFacebook IconLinkedin IconWhatsapp IconMessenger Icon