Rediscovering *-MINIMAX search

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

Volumn 3846 LNCS, Issue , 2006, Pages 35-50

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

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; SAMPLING; STATISTICAL METHODS; STOCHASTIC CONTROL SYSTEMS; TREES (MATHEMATICS);

FULL-WIDTH SEARCH ALGORITHMS; MINIMAX TREES; STATISTICAL SAMPLING;

INTERACTIVE COMPUTER SYSTEMS;

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

References (8)

1. Bruce Ballard. The *-Minimax search procedure for trees containing chance nodes. Artificial Intelligence, 21(3):327-350, 1983.
2. Darse Billings, Aaron Davidson, Jonathan Schaeffer, and Duane Szafron. The challenge of poker. Artificial Intelligence, 134(1-2):201-240, 2002.
3. Matt Ginsberg. GIB: Steps toward an expert-level bridge-playing program. In International Joint Conference on Artificial Intelligence, pages 584-589, 1999.
4. Thomas Hauk. Search in trees with chance nodes. Master's thesis, Computing Science, University of Alberta, 2004.
5. Thomas Hauk, Michael Buro, and Jonathan Schaeffer. *-Minimax performance in backgammon. In H.J. van den Herik, Y. Björnsson, and N. Netanyahu, editors, Computers and Games 2004, volume 3864 of LNCS, pages 51-66, Ramat-Gan, Israel, 2005. Springer-Verlag.
6. Donald 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.
7. Brian Sheppard. Towards Perfect Play of Scrabble. PhD thesis, Institute for Knowledge and Agent Technology (IKAT), Universiteit Maastricht, 2002.
8. Gerald Tesauro. Temporal difference learning and TD-Gammon. Communications of the ACM, 38(3):58-68, 1995.