| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10334201 | Theoretical Computer Science | 2005 | 17 Pages |
Abstract
The algorithm is powerful enough to solve arbitrary 7Ã7 game-states. In particular, we use it to determine the outcome of a 7Ã7 Hex game after each of the 49 possible opening moves, in each case finding an explicit proof-tree for the winning player.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Ryan Hayward, Yngvi Björnsson, Michael Johanson, Morgan Kan, Nathan Po, Jack van Rijswijck,