Transposition tables have long been a viable tool in the pruning mechanisms of game-tree search algorithms. In such applications, a transposition table can reduce a game-tree to a game-graph with unique board positions at the nodes. This paper proposes a transposition table extension, called a template matching table, where templates that prove winning positions are used to map features of board positions to board values. This paper demonstrates that a game-tree search for the game of Hex can have a more effective pruning mechanism using a template matching table than it does using a transposition table. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Rasmussen, R., Maire, F., & Hayward, R. (2007). A template matching table for speeding-up game-tree searches for hex. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4830 LNAI, pp. 283–292). Springer Verlag. https://doi.org/10.1007/978-3-540-76928-6_30
Mendeley helps you to discover research relevant for your work.