Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Fraenkel, A.S.: Combinatorial games: Selected bibliography with a succinct gourmet introduction. Electronic Journal of Combinatorics (1994)
van Rijswijck, J.: Computer Hex: Are Bees Better than Fruitflies? Thesis: Master of science, University of Alberta (2000)
Brudno, A.L.: Bounds and valuations for abridging the search of estimates. Problems of Cybernetics 10, 225–241 (1963)
Bruin, A.D., Pijls, W.: Trends in game tree search. In: Conference on Current Trends in Theory and Practice of Informatics, pp. 255–274 (1996)
Kishimoto, A., Müller, M.: A general solution to the graph history interaction problem. In: McGuinness, D.L., Ferguson, G. (eds.) AAAI, pp. 644–649. AAAI Press / The MIT Press (2004)
Anshelevich, V.V.: A hierarchical approach to computer hex. Artificial Intelligence 134, 101–120 (2002)
van Rijswijck, J.: Search and Evaluation in Hex. Thesis: Master of science, University of Alberta (2002)
Gardener, M.: The game of hex. In: The Scientific American Book of Mathematical Puzzles and Diversions, Simon and Schuster, New York (1959)
Anshelevich, V.V.: An automatic theorem proving approach to game programming. In: Proceedings of the Seventh National Conference of Artificial Intelligence, pp. 194–198. AAAI Press, California (2000)
Hayward, R., Björnsson, Y., Johanson, M., Kan, M., Po, N., Rijswijck, J.V. (eds.): Advances in Computer Games: Solving 7x7 HEX: Virtual Connections and Game-State Reduction. IFIP International Federation of Information Processing, vol. 263. Kluwer Achedemic Publishers, Boston (2003)
Rasmussen, R., Maire, F., Hayward, R.: A move generating algorithm for hex solvers. In: Sattar, A., Kang, B.-H. (eds.) AI 2006. LNCS (LNAI), vol. 4304, pp. 637–646. Springer, Heidelberg (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rasmussen, R., Maire, F., Hayward, R. (2007). A Template Matching Table for Speeding-Up Game-Tree Searches for Hex. In: Orgun, M.A., Thornton, J. (eds) AI 2007: Advances in Artificial Intelligence. AI 2007. Lecture Notes in Computer Science(), vol 4830. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76928-6_30
Download citation
DOI: https://doi.org/10.1007/978-3-540-76928-6_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-76926-2
Online ISBN: 978-3-540-76928-6
eBook Packages: Computer ScienceComputer Science (R0)