Abstract
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.
Keywords
Download to read the full chapter text
Chapter PDF
References
Anshelevich, V. (2002). A Hierarchical Approach to Computer Hex. Artificial Intelligence, 134 (12): 101–120.
Beck, A. (1969). Games. In Beck, A., Bleicher, M. N., and Crowe, D. W., editors, Excursions into Mathematics, pages 317–387. Worth Publishers, New York, NY.
Beck, A. (2000). Appendix 2000. In Beck, A., Bleicher, M. N., and Crowe, D. W., editors, Excursions into Mathematics: The Millennium Edition. A. K. Peters, Natick, MA.
Berge, C. (1977). L’Art Subtil du Hex. Manuscript.
Browne, C. (2000). Hex Strategy: Making the Right Connections. A. K. Peters, Natick, MA.
Gale, D. (1979). The Game of Hex and the Brouwer Fixed Point Theorem. American Mathematical Monthly, 86 (10): 818–827.
Gardner, M. (1959). The Scientific American Book of Mathematical Puzzles and Diversions, chapter The game of Hex, pages 73–83. Simon and Schuster, New York.
Hayward, R. (2003a). Berge and the Art of Hex. In Bondy, A. and Chvâtal, V., editors,A Biography of Claude Berge. Princeton University Press. To appear.
Hayward, R. (2003b). A Note on Domination in Hex. Manuscript.
Hayward, R. and Rijswijck, J. v. (200x). On Hex and Mathematics. Manuscript. Submitted to Discrete Mathematics.
Karp, R. (1972). Reducibility Among Combinatorial Problems. In Miller, R. and Thatcher, J., editors, Complexity of Computer Computations, pages 85–103. Plenum Press, New York. Nasar, S. (1998). A Beautiful Mind. Touchstone Books, New York.
Reisch, S. (1981). Hex ist PSPACE-vollständig. Acta Informatica, 15: 167–191.
Rijswijck, J. v. (1999–2003). Queenbee home page. http://www.cs.ualberta.ca/“queenbee.
Rijswijck, J. v. (2000). Computer Hex: Are Bees better than Fruitflies? Master’s thesis, University of Alberta, Edmonton, Canada.
Rijswijck, J. v. (2002). Search and Evaluation in Hex. Technical report, University of Alberta. Saks, M. (2003). Private communication.
Yang, J. (2003). A winning 9x9 Hex Strategy. http://www.ee.umanitoba.ca/“jingyang.
Yang, J., Liao, S., and Pawlak, M. (2001). A Decomposition Method for Finding Solution in Game Hex 7x7. In International Conference on Application and Development of Computer Games in the 21st Century,pages 96–111, Hong Kong.
Yang, J.,Liao, S., and Pawlak, M. (2002a). Another Solution for Hex 7x7. Technical report, University of Manitoba, Winnipeg, Canada. http://www.ee.umanitoba.ca/“jingyang/TR.pdf.
Yang, J., Liao, S., and Pawlak, M. (2002b). New Winning and Losing Positions for 7x7 Hex. In Computers and Games,Edmonton.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 IFIP International Federation for Information Processing
About this chapter
Cite this chapter
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: Van Den Herik, H.J., Iida, H., Heinz, E.A. (eds) Advances in Computer Games. IFIP — The International Federation for Information Processing, vol 135. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35706-5_17
Download citation
DOI: https://doi.org/10.1007/978-0-387-35706-5_17
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-4424-8
Online ISBN: 978-0-387-35706-5
eBook Packages: Springer Book Archive