Algorithmic approaches for playing and solving Shannon games
Rasmussen, Rune K. (2008) Algorithmic approaches for playing and solving Shannon games. .
The game of Hex is a board game that belongs to the family of Shannon games, which are connection-oriented games where players must secure certain connected components in graphs. The problem of solving Hex is a decision problem complete in PSPACE, which implies that the problem is NP-Hard. Although the Hex problem is difficult to solve, there are a number of problem reduction methods that allow solutions to be found for small Hex boards within practical search limits. The present work addresses two problems, the problem of solving the game of Hex for small board sizes and the problem of creating strong artificial Hex players for larger boards. Recently, a leading Hex solving program has been shown to solve the 7x7 Hex board, but failed to solve 8x8 Hex within practical limits. This work investigates Hex-solving techniques and introduces a series of new search optimizations with the aim to develop a better Hex solver. The most significant of these new optimization techniques is a knowledge base approach that stores and reuses search information to prune Hex-solving searches. This technique involves a generalized form of transposition table that stores game features and uses such features to prove that certain board positions are winning. Experimental results demonstrate a knowledge base Hex solver that significantly speeds up the solving of 7x7 Hex. The search optimization techniques for Hex solvers given here are highly specialized. This work reports on a search algorithm for artificial Hex players, called Pattern Enhanced Alpha-Beta search that can utilize these optimization techniques. On large board positions, an artificial Hex player based on the Pattern Enhanced Alpha- Beta search can return moves in practical times if search depths are limited. Such a player can return a good move provided that the evaluated probabilities of winning on board positions at the depth cut-offs are accurate. Given a large database of Hex games, this work explores an apprenticeship learning approach that takes advantage of this database to derive board evaluation functions for strong Hex playing policies. This approach is compared against a temporal difference learning approach and local beam search approach. A contribution from this work is a method that can automatically generate good quality evaluation functions for Hex players.
Impact and interest:
Citation countsare sourced monthly fromand citation databases.
These databases contain citations from different subsets of available publications and different time periods and thus the citation count from each is usually different. Some works are not in either database and no count is displayed. Scopus includes citations from articles published in 1996 onwards, and Web of Science® generally from 1980 onwards.
Citations counts from theindexing service can be viewed at the linked Google Scholar™ search.
Full-text downloadsdisplays the total number of times this work’s files (e.g., a PDF) have been downloaded from QUT ePrints as well as the number of downloads in the previous 365 days. The count includes downloads for all files if a work has more than one.
|Item Type:||QUT Thesis (PhD)|
|Supervisor:||Maire, Frederic D.|
|Keywords:||Shannon games, algorithmic approaches|
|Divisions:||Past > QUT Faculties & Divisions > Faculty of Science and Technology|
|Institution:||Queensland University of Technology|
|Deposited On:||11 Mar 2009 10:19|
|Last Modified:||09 Feb 2011 23:53|
Repository Staff Only: item control page