A template matching table for speeding-up game-tree searches for hex

Authors:
Rune Rasmussen;Frederic Maire;Ross Hayward
Affiliations:
Faculty of Information Technology, Queensland University of Technology, Brisbane, QLD, Australia;Faculty of Information Technology, Queensland University of Technology, Brisbane, QLD, Australia;Faculty of Information Technology, Queensland University of Technology, Brisbane, QLD, Australia
Venue:
AI'07 Proceedings of the 20th Australian joint conference on Advances in artificial intelligence
Year:
2007

Citing 5
Cited 3

A hierarchical approach to computer Hex

Artificial Intelligence - Chips challenging champions: games, computers and Artificial Intelligence
Trends in Game Tree Search

SOFSEM '96 Proceedings of the 23rd Seminar on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
The Game of Hex: An Automatic Theorem Proving Approach to Game Programming

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
A general solution to the graph history interaction problem

AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
A move generating algorithm for hex solvers

AI'06 Proceedings of the 19th Australian joint conference on Artificial Intelligence: advances in Artificial Intelligence

A game theory approach to high-level strategic planning in first person shooters

IE '08 Proceedings of the 5th Australasian Conference on Interactive Entertainment
Solving 8×8 Hex

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Solving hex: beyond humans

CG'10 Proceedings of the 7th international conference on Computers and games

Quantified Score

Hi-index	0.00

Visualization

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.