*-MINIMAX performance in backgammon

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3846 LNCS, Issue , 2006, Pages 51-66

  Hauk, Thomas ^a   Buro, Michael ^a   Schaeffer, Jonathan ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER HARDWARE; EVALUATION; FUNCTIONS;

-MINIMAX ALGORITHMS; BACKGAMMON; BALLARD'S; STAR2 ALGORITHM;

INTERACTIVE COMPUTER SYSTEMS;

EID: 33745117232     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11674399_4     Document Type: Conference Paper

References (16)

1. GNU Backgammon (backgammon software). http://www.gnubg.org/.
2. Jellyfish (backgammon software). http://jelly.effect.no/.
3. Snowie (backgammon software). http://www.bgsnowie.com/.
4. B.W. Ballard. The *-Minimax Search Procedure for Trees Containing Chance Nodes. Artificial Intelligence, 21(3):327-350, 1983.
5. H. Berliner. Backgammon Computer Program Beats World Champion. Artificial Intelligence, 14:205-220, 1980.
6. T. Hauk, Search in Trees with Chance Nodes. M.Sc. Thesis, Computing Science Department, University of Alberta, 2004.
7. T. Hauk, M. Buro, and J. Schaeffer. Rediscovering *-Minimax. In H.J. van den Herik, Y. Björnsson, and N. Netanyahu, editors, Computers and Games 2004, volume 3864 of LNCS, pages 35-50, Ramat-Gan, Israel, 2005. Springer-Verlag.
8. M. Howard. The Duel, August 5, 2003. [Online] rec.games.backgammon.
9. D. Michie. Game-playing and game-learning automata. In L. Fox, editor, Advances in Programming and Non-Numerical Computation, pages 183-200. Pergamon, New York, 1966.
10. R.S. Sutton and A.G. Barto. Reinforcement Learning: An Introduction. MIT Press, Cambridge, MA, 1998.
11. G. Tesauro. Neurogammon: A neural-network backgammon learning program. In D.N. Levy and D.F. Beal, editors, Heuristic Programming in Artificial Intelligence, pages 78-80. Ellis Horwood, 1989.
12. G. Tesauro. Temporal Difference Learning and TD-Gammon. Communications of the ACM, 38(3), March 1995.
13. G. Tesauro. Programming Backgammon Using Self-Teaching Neural Nets. Artificial Intelligence, 134(1-2):181-199, 2002.
14. G. Tesauro and G.R. Galperin. On-line policy improvement using Monte Carlo search. Proc. of NIPS, pages 1068-1074, 1996.
15. J. Thyssen, 2003. Personal Communication.
16. A.L. Zobrist. A New Hashing Method with Applications for Game Playing. ICCA Journal, 13(2):69-73, 1990.