Effective Use of Transposition Tables in Stochastic Game Tree Search

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.