The {\alpha}{\mu} Search Algorithm for the Game of Bridge
Artificial Intelligence
2019-11-20 v1
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.
Keywords
Cite
@article{arxiv.1911.07960,
title = {The {\alpha}{\mu} Search Algorithm for the Game of Bridge},
author = {Tristan Cazenave and Véronique Ventos},
journal= {arXiv preprint arXiv:1911.07960},
year = {2019}
}