Minimax Performance in Backgammon

This paper presents the first performance results for Ballard’s *-Minimax algorithms applied to a real–world domain: backgammon. It is shown that with effective move ordering and probing the Star2 algorithm considerably outperforms Expectimax. Star2 allows strong backgammon programs to conduct depth...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Hauk, Thomas, Buro, Michael, Schaeffer, Jonathan
Format:	Buchkapitel
Sprache:	eng
Schlagworte:	Applied sciences Chance Node Computer science control theory systems Computer systems and distributed systems. User interface Contact Position Exact sciences and technology Good Move Move Node Reward Signal Software
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!