Solving 7 × 7 Hex with domination, fill-in, and virtual connections

Theoretical Computer Science

Volumn 349, Issue 2, 2005, Pages 123-139

  Hayward, Ryan ^a   Björnsson, Yngvi ^b   Johanson, Michael ^a   Kan, Morgan ^a   Po, Nathan ^a   Van Rijswijck, Jack ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

^b REYKJAVIK UNIVERSITY   (Iceland)

Author keywords

Fill in; Game state reduction; Hex; Move domination; Move ordering; Pattern set; Virtual connection

Indexed keywords

GAME THEORY; PROBLEM SOLVING; TREES (MATHEMATICS);

FILL-IN; GAME-STATE REDUCTION; HEX; MOVE DOMINATION; MOVE ORDERING; PATTERN SET; VIRTUAL CONNECTION;

ALGORITHMS;

EID: 27844503063     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.09.042     Document Type: Article

References (29)

1. V. Anshelevich The game of Hex: an automatic theorem proving approach to game programming Proc. 17th National Conf. on AI (AAAI-2000) 2000 189 194
2. V. Anshelevich The game of Hex: the hierarchical approach R.J. Nowakowski More Games of No Chance Vol. 42 2002 MSRI Publications, Cambridge University Press Cambridge 151 165
3. V. Anshelevich, A hierarchical approach to computer Hex, in: J. Schaeffer, H.J. van den Herik, (Eds.), Chips, Computers and Artificial Intelligence, Elsevier, Amsterdam, 2002, 141-160. Artificial Intelligence 134 (2002) 101-120.
4. A. Beck, M.N. Bleicher, D.W. Crowe, Excursions into Mathematics, Worth, New York, pp. 317-387, 1969 (chapter Games).
5. A. Beck, M.N. Bleicher, D.W. Crowe, Excursions into Mathematics: the Millennium Edition, A.K. Peters, Natick, 2000 (chapter Appendix 2000).
6. C. Berge, L'Art Subtil du Hex, Manuscript, 1977.
7. Y. Björnsson, R. Hayward, M. Johanson, J. van Rijswijck, Dead cell analysis in Hex and the Shannon game, Manuscript: < www.cs.ualberta.ca/ ∼ hayward/publications.html >, 2004. Submitted to Proc. Graph Theory.
8. C. Browne Hex Strategy: Making the Right Connections 2000 A.K. Peters Natick, MA
9. B. Enderton, Answers to infrequently asked questions about the game of Hex < www.cs.cmu.edu/ ∼ hde/hex/hexfaq >, 1995.
10. D. Gale The game of Hex and the Brouwer fixed point theorem Amer. Math. Monthly 86 10 1979 818 827
11. M. Gardner, Mathematical games, Scientific American 197 (1957) 145-150, 120-127, 130-138.
12. M. Gardner, The Scientific American Book of Mathematical Puzzles and Diversions, Simon and Schuster, New York, 1959, pp. 73-83 (chapter The game of Hex).
13. M.R. Garey, and D.S. Johnson Computers and Intractability 1979 W.H. Freeman and Co. San Francisco
14. R.B. Hayward, J. van Rijswijck, Hex and Combinatorics, Manuscript < www.cs.ualberta.ca/ ∼ hayward/publications.html >, 2004. To appear in Discrete Mathematics.
15. R.B. Hayward, A note on domination in Hex, Manuscript < www.cs.ualberta.ca/ ∼ hayward/publications.html >, January 2003.
16. R.B. Hayward, Berge and the Art of Hex, in: A. Bondy, V. Chvátal, (Eds.), A Biography of Claude Berge, Manuscript < www.cs.ualberta.ca/ ∼ hayward/publications.html >, 2003. Princeton University Press, in preparation.
17. R.B. Hayward, Y. Björnsson, M. Johanson, M. Kan, N. Po, J. van Rijswijck, Solving 7 × 7 Hex: virtual connections and game-state reduction, in: H. Jaap van den Herik, H. Iida, E.A. Heinz, (Eds.), Advances in Computer Games, IFIP International Federation for Information Processing, Vol. 263, Kluwer Academic Publishers, Boston, 2003, pp. 261-278.
18. R.M. Karp Reducibility among combinatorial problems R.E. Miller J.W. Thatcher Complexity of Computer Computations 1972 Plenum Press New York 85 103
19. S. Kiefer, Die Menge der Virtuellen Verbindungen im Spiel Hex ist PSPACE-völlstandig. Studienarbeit Nr. 1887, Facultät für Informatik, Electrotechnik, und Informationstechnik, Universität Stuttgart, July 2003.
20. S. Nasar A Beautiful Mind 1998 Touchstone New York
21. S. Reisch Hex ist PSPACE-vollständig Acta Informatica 15 1981 167 191
22. C. Schensted, and C. Titus Mudcrack Y and Poly-Y 1975 Neo Press Peaks Island, Maine
23. J. van Rijswijck, Queenbee's home page < www.cs.ualberta.ca/ ∼ queenbee >.
24. J. van Rijswijck, Computer Hex: Are Bees better than Fruitflies? Master's Thesis, University of Alberta, Edmonton, Canada, 2000.
25. J. van Rijswijck, Search and evaluation in Hex, Technical Report, University of Alberta, 2002 < www.cs.ualberta.ca/ ∼ javhar/research.html >.
26. J. Yang, Jing yang's web site < www.ee.umanitoba.ca/ ∼ jingyang >, 2003.
27. J. Yang, S. Liao, and M. Pawlak A decomposition method for finding solution in game Hex 7 × 7 Internat. Conf. on Application and Development of Computer Games in the 21st Century November 2001 96 111
28. J. Yang, S. Liao, M. Pawlak, Another solution for Hex 7 × 7, Technical Report, University of Manitoba, Winnipeg, Canada, 2002 < www.ee.umanitoba.ca/ ∼ jingyang/TR.pdf >.
29. J. Yang, S. Liao, M. Pawlak, New Winning and Losing Positions for 7x7 Hex, in: Computers and Games, Lecture Notes in Computer Science, Vol. 2883, Springer, Berlin, 2002, pp. 230-248.