A Template Matching Table for Speeding-Up Game-Tree Searches for Hex
Rasmussen, Rune K., Maire, Frederic D., & Hayward, Ross F. (2007) A Template Matching Table for Speeding-Up Game-Tree Searches for Hex. In Orgun, Mehmet A. & Thornton, John (Eds.) 20th Australian Joint Conference on Artificial Intelligence, December 2-6, Gold Coast.
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.
Impact and interest:
Citation counts are sourced monthly from and citation databases.
Citations counts from theindexing service can be viewed at the linked Google Scholar™ search.
|Item Type:||Conference Paper|
|Additional Information:||For more information, please refer to the publisher’s website (see hypertext link) or contact the author.|
|Subjects:||Australian and New Zealand Standard Research Classification > INFORMATION AND COMPUTING SCIENCES (080000) > ARTIFICIAL INTELLIGENCE AND IMAGE PROCESSING (080100) > Artificial Intelligence and Image Processing not elsewhere classified (080199)|
|Divisions:||Past > QUT Faculties & Divisions > Faculty of Science and Technology|
|Copyright Owner:||Copyright 2007 Springer|
|Copyright Statement:||The original publication is available at SpringerLink http://www.springerlink.com|
|Deposited On:||19 Feb 2008|
|Last Modified:||29 Feb 2012 13:34|
Repository Staff Only: item control page