The αμ Search Algorithm for the Game of Bridge

Tristan Cazenave, Véronique Ventos

Abstract

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.
BibTeX
@inproceedings{cazenave2019search,
  author = {Tristan Cazenave and Véronique Ventos},
  title = {{The αμ Search Algorithm for the Game of Bridge}},
  booktitle = {Base},
  year = {2019},
  doi = {10.48550/arxiv.1911.07960},
}

Loading related content...

Figure