Effective use of transposition tables in stochastic game tree search

Proceedings of the 2007 IEEE Symposium on Computational Intelligence and Games, CIG 2007

Volumn , Issue , 2007, Pages 112-116

  Veness, Joel ^a,b   Blair, Alan ^a,b  

^a CSIRO   (Australia)

^b UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

Expectimax; Pruning; Star1; Star2; Stochastic game tree search; Transposition table

Indexed keywords

GAME THEORY; RANDOM PROCESSES;

STOCHASTIC GAME TREE SEARCH; TRANSPOSITION TABLES;

TREES (MATHEMATICS);

EID: 34548800204     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CIG.2007.368086     Document Type: Conference Paper

References (9)

1. T. Hauk. M. Buro, and J. Schaeffer. Rediscovering *-Minimax. Computers and Games conference, 2004.
2. Bruce W. Ballard. The *-minimax search procedure for trees containing chance nodes. Artificial Intelligence, 21:327-350, 1983.
3. T. Hauk. Search in Trees with Chance Nodes. M.Sc. Thesis, Computing Science Department, University of Alberta, 2004.
4. T. Hauk, M. Buro, and J. Schaeffer. *-Minimax performance in backgammon. Computers and Games, 2004.
5. th ACM Computer Science Conference, pages 124-130, 1996.
6. G. Tesauro. Temporal Difference Learning and TD-Gammon. Communications of the ACM. 38(3), March 1995.
7. J. Schaeffer. The history heuristic and alpha-beta search enhancements in practice. IEEE Transactions on Pattern Analysis and Machine Intelligence, 11(1):1203-1212, 1989.
8. A. L. Zobrist. A new hashing method with applications for game playing. Technical Report 88, University of Wisconsin, 1970.
9. R. Hyatt, A High-Performance Parallel Algorithm to Search Depth-First Game Trees, Ph.D. Dissertation, University of Alabama at Birmingham, 1988.