DocumentCode
2715865
Title
Effective Use of Transposition Tables in Stochastic Game Tree Search
Author
Veness, Joel ; Blair, Alan
Author_Institution
Nat. ICT Australia, Canberra, ACT
fYear
2007
fDate
1-5 April 2007
Firstpage
112
Lastpage
116
Abstract
Transposition tables are one common method to improve an alpha-beta searcher. We present two methods for extending the usage of transposition tables to chance nodes during stochastic game tree search. Empirical results show that these techniques can reduce the search effort of Ballard´s Star2 algorithm by 37 percent.
Keywords
search problems; stochastic games; trees (mathematics); Ballard Star2 algorithm; alpha-beta searcher; stochastic game tree search; transposition tables; Australia; Computational intelligence; Computer science; Minimax techniques; Stochastic processes; Expectimax; Pruning; Star2; Starl; Stochastic Game Tree Search; Transposition Table;
fLanguage
English
Publisher
ieee
Conference_Titel
Computational Intelligence and Games, 2007. CIG 2007. IEEE Symposium on
Conference_Location
Honolulu, HI
Print_ISBN
1-4244-0709-5
Type
conf
DOI
10.1109/CIG.2007.368086
Filename
4219031
Link To Document