Solving 7×7 Hex : Virtual connections and game-state reduction
Dagsetning
Höfundar
Journal Title
Journal ISSN
Volume Title
Útgefandi
Springer New York LLC
Útdráttur
We present an algorithm which determines the outcome of an arbitrary Hex game-state by finding a winning virtual connection for the winning player. Our algorithm performs a recursive descent search of the game-tree, combining fixed and dynamic game-state virtual connection composition rules with some new Hex game-state reduction results based on move domination. 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.
Lýsing
Efnisorð
Game-state reduction, Hex, Move domination, Move ordering, Pattern set, Virtual connection, Information Systems, Computer Networks and Communications, Information Systems and Management
Citation
Hayward, R, Björnsson, Y, Johanson, M, Kan, M, Po, N & van Rijswijck, J 2004, Solving 7×7 Hex : Virtual connections and game-state reduction. in Advances in Computer Games : Many Games, Many Challenges - Proceedings of the ICGA/ IFIP SG16 10th Advances in Computer Games Conference, ACG 2005. IFIP Advances in Information and Communication Technology, vol. 135, Springer New York LLC, pp. 261-278, 10th InternationalAdvances in Computer Games Conference, ACG 2005, Graz, Austria, 24/11/03. https://doi.org/10.1007/978-0-387-35706-5_17
conference
conference