Abstract
We present a concise and/or-tree notation for describing Hex strategies together with an easily implemented algorithm for verifying strategy correctness. To illustrate our algorithm, we use it to verify Jing Yang’s 7×7 centre-opening strategy.
Authors gratefully acknowledge the support of NSERC and the University of Alberta Games Group.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Gardner, M.: Mathematical Games. Scientific American 197, July, pp. 145–150, August, pp. 120–127, October, pp. 130–138 (1957)
Gardner, M.: The Scientific American Book of Mathematical Puzzles and Diversions, pp. 73–83. Simon and Schuster, New York (1959)
Hayward, R.B., van Rijswijck, J.: Hex and Combinatorics (formerly Notes on Hex). Discrete Mathematics 306, 2515–2528 (2006)
Hayward, R.B., Björnsson, Y., Johanson, M., Kan, M., Po, N., van Rijswijck, J.: 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 (ACG10), Many Games, Many Challenges, pp. 261–278. Kluwer Academic Publishers, Boston (2004)
Hayward, R.B., Björnsson, Y., Johanson, M., Kan, M., Po, N., van Rijswijck, J.: Solving 7×7 Hex with Domination, Fill-in, and Virtual Connections. Theoretical Computer Science 349, 123–139 (2005)
Maarup, Th.: Hex – Everything You Always Wanted to Know About Hex but Were Afraid to Ask. Master’s thesis, Department of Mathematics and Computer Science, University of Southern Denmark, Odense, Denmark (2005)
Maarup, Th.: Hex Webpage (2005), http://maarup.net/thomas/hex/
Nasar, S.: A Beautiful Mind. Touchstone, New York (1998)
Nash, J.: Some Games and Machines for Playing Them. Technical Report D-1164, Rand Corp. (1952)
Noshita, K.: Union-Connections and Straightforward Winning Strategies in Hex. ICGA Journal 28(1), 3–12 (2005)
Reisch, S.: Hex ist PSPACE-vollständig. Acta Informatica 15, 167–191 (1981)
Yang, J.: Jing Yang’s Web Site (2003), http://www.ee.umanitoba.ca/~jingyang
Yang, J., Liao, S., Pawlak, M.: A Decomposition Method for Finding Solution in Game Hex 7x7. In: International Conference on Application and Development of Computer Games in the 21st Century, pp. 96–111 (November 2001)
Yang, J., Liao, S., Pawlak, M.: On a Decomposition Method for Finding Winning Strategy in Hex Game (2001), http://www.ee.umanitoba.ca/~jingyang/hexsol.pdf
Yang, J., Liao, S., Pawlak, M.: Another Solution for Hex 7x7. Technical report, University of Manitoba, Winnipeg, Canada (2002), http://www.ee.umanitoba.ca/~jingyang/TR.pdf
Yang, J., Liao, S., Pawlak, M.: New Winning and Losing Positions for 7x7 Hex. In: Schaeffer, J., Müller, M., Björnsson, Y. (eds.) CG 2002. LNCS, vol. 2883, pp. 230–248. Springer, Heidelberg (2003)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hayward, R.B., Arneson, B., Henderson, P. (2007). Automatic Strategy Verification for Hex. In: van den Herik, H.J., Ciancarini, P., Donkers, H.H.L.M.(. (eds) Computers and Games. CG 2006. Lecture Notes in Computer Science, vol 4630. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75538-8_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-75538-8_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75537-1
Online ISBN: 978-3-540-75538-8
eBook Packages: Computer ScienceComputer Science (R0)