The {\alpha}{\mu} Search Algorithm for the Game of Bridge
{\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 ap...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | {\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. |
|---|---|
| DOI: | 10.48550/arxiv.1911.07960 |