Hex and combinatorics

Discrete Mathematics

Volumn 306, Issue 19-20, 2006, Pages 2515-2528

  Hayward, Ryan B ^a   van Rijswijck, Jack ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

Game of Hex

Indexed keywords

GAME THEORY; NUMERICAL ANALYSIS; NUMERICAL METHODS;

COMBINATORICS; GAME OF HEX;

COMBINATORIAL MATHEMATICS;

EID: 33748753764     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2006.01.029     Document Type: Article

References (51)

1. V. Anshelevich, The game of Hex: an automatic theorem proving approach to game programming, Proceedings of the 17th National Conference on AI (AAAI-2000), 2000, pp. 189-194.
2. V. Anshelevich. The game of Hex: the hierarchical approach, July 2000. 〈http://www.msri.org/publications/ln/msri/2000/gametheory/anshelevich/1/〉.
3. Anshelevich V. Hexy wins Hex tournament. Internat. Comput. Games Assoc. 23 3 (2000) 181-184
4. Anshelevich V. A hierarchical approach to computer Hex. Artificial Intelligence 134 (2002) 101-120 (Also in: J. Schaeffer and J. Van den Herik, (Eds). Chips, Computers and Artificial Intelligence, Elsevier, Amsterdam, 2002, pp. 141-160.)
5. A. Beck, M.N. Bleicher, D.W. Crowe, Games, Excursions into Mathematics, Worth, New York, 1969, pp. 317-387.
6. A. Beck, M.N. Bleicher, D.W. Crowe, Appendix 2000. Excursions into Mathematics: the Millennium Edition, AK Peters, Natick, 2000.
7. C. Berge, L'art subtil du Hex, Manuscript, 1977.
8. Berge C. Some remarks about a Hex problem. In: Klarner D. (Ed). The Mathematical Gardner (1981), Wadsworth International, Belmont 25-27
9. Y. Björnsson, R. Hayward, M. Johanson, J. van Rijswijck, Dead cell analysis in Hex and the Shannon Game, Proceedings of Graph Theory 2004, 〈http://www.cs.ualberta.ca/∼hayward/publications.html〉, to appear.
10. Browne C. Hex Strategy: Making the Right Connections (2000), AK Peters, Natick, MA
11. C. Browne, Puzzle J, Abstract Games Magazine, 8:21, 2001. Solution in C. Browne, Puzzle J, Abstract Games Magazine, 10:28, 2002.
12. B. Enderton, Answers to infrequently asked questions about the game of Hex. 1995. 〈http://www.cs.cmu.edu/∼hde/hex/hexfaq/〉.
13. Evans R.J. A winning opening in reverse Hex. J. Recreational Math. 7 3 (1974) 189-192
14. Even S., and Endre Tarjan R. A combinatorial problem which is complete in polynomial space. J. Comput. Mach. 23 (1976) 710-719
15. Gale D. The game of Hex and the Brouwer fixed point theorem. Amer. Math. Monthly 86 10 (1979) 818-827
16. D. Gale, February 2000, private communication.
17. Gardner M. Mathematical games. Sci. Amer. 197 (1957) 145-150 August 120-127; October 130-138
18. M. Gardner, The game of Hex, The Scientific American Book of Mathematical Puzzles and Diversions, Simon and Schuster, New York, 1959, pp. 73-83.
19. Gardner M. Mathematical games. Sci. Amer. 205 1 (1961) 148-168
20. R.B. Hayward, A note on domination in Hex. January 2003. Manuscript 〈http://www.cs.ualberta.ca/∼hayward/publications.html〉.
21. R.B. Hayward, Berge and the art of Hex, Manuscript, 2003, in: J.A. Bondy/V. Chvátal (Eds.), A biography of Claude Berge, Princeton University Press, Princeton, NJ, 〈http://www.cs.ualberta.ca/∼hayward/publications.html〉, to appear.
22. 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.J. van den Herik, H. Iida, E.A. Heinz (Eds.), Advances in Computer Games, vol. 263 of IFIP International Federation for Information Processing, Kluwer Academic Publishers, Boston, 2003, pages 261-278.
23. Hayward R.B., Björnsson Y., Johanson M., Kan M., Po N., and van Rijswijck J. Solving 7 × 7 Hex with domination, fill-in, and virtual connections. Theoret. Comput. Sci. 349 (2005) 123-139
24. P. Hein, Vil de laere polygon? Series of articles in Politiken newspaper, starting 26 December 1942.
25. T.R. Jensen, B. Toft, Graph Colouring Problems, Winning Hex, Wiley Interscience, New York, 1995, pp. 271-275. (Chapter 17.14)
26. H.W. Kuhn, S. Nasar, (Eds.), The Essential John Nash, Princeton University Press, Princeton, NJ, 2001.
27. Lagarias J., and Sleator D. Who wins misère Hex?. In: Berlekamp E., and Rogers T. (Eds). The Mathemagician and Pied Puzzler (1999), AK Peters, Natick, MA 237-240
28. Lehman A. A solution of the Shannon switching game. J. Soc. Indust. Appl. Math. 12 (1964) 687-725
29. T. Maarup, 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.
30. T. Maarup, Hex webpage. 2005 〈http://www.maarup.net/thomas/hex/〉.
31. Melis G., and Hayward R. Six wins Hex tournament. Internat. Comput. Games Assoc. 26 4 (2003) 277-280
32. S. Meyers, 2002. private communication.
33. Milnor J. A Nobel prize for John Nash. Math. Intell. 17 3 (1995) 11-17
34. Nasar S. A Beautiful Mind (1998), Touchstone, New York
35. J. Nash, Some games and machines for playing them. Technical Report D-1164, Rand Corp., 1952.
36. J. Nash, December 2 1999. Telephone conversation with R. Hayward and J. van Rijswijck.
37. Von Neumann J., and Morgenstern O. Theory of Games and Economic Behaviour (1944), Princeton University Press, Princeton, NJ
38. K. Noshita, Union-connections and a simple readable winning way in 7 × 7 Hex, Proceedings of the Ninth Game Programming Japan Workshop, November 12-14, 2004, pp. 72-79.
39. R. Rasmussen, F. Maire, An extension of the H-search algorithm for artificial Hex players, Proceedings of the 17th Australian Joint Conference on AI, 2004, pp. 646-657.
40. Reisch S. Hex ist PSPACE-vollständig. Acta Inform. 15 (1981) 167-191
41. S. Sackson and Editors of Klutz Press, The Book of Classic Board Games, Klutz Press, Palo Alto, CA, 1991.
42. Schensted C., and Titus C. Mudcrack Y and Poly-Y (1975), Neo Press, Peaks Island, Maine
43. Shannon C. Computers and automata. Proc. Inst. Radio Eng. 41 10 (1953) 1234-1241
44. J. van Rijswijck, Queenbee's home page, 2000, 〈http://www.cs.ualberta.ca/∼queenbee〉.
45. J. van Rijswijck, Computer Hex: Are Bees better than Fruitflies? Master's thesis, Department of Computing Science, University of Alberta, Edmonton, Canada, 2000.
46. J. van Rijswijck, Search and evaluation in Hex, Technical Report, University of Alberta, 2002, 〈 http://www.cs.ualberta.ca/∼javhar/research.html〉.
47. Willemson J., and Björnsson Y. Six wins Hex tournament. Internat. Comput. Games Assoc. 27 3 (2004)
48. J. Yang, Jing yang's web site, 2003-2006. 〈http://www.ee.umanitoba.ca/∼jingyang〉.
49. J. Yang, S. Liao, M. Pawlak, A decomposition method for finding solution in game Hex 7 × 7, in: International Conference on Application and Development of Computer Games in the 21st Century, November 2001, pp. 96-111.
50. J. Yang, S. Liao, M. Pawlak, Another solution for Hex 7 × 7, Technical Report, University of Manitoba, Winnipeg, Canada, 2002, 〈http://www.ee.umanitoba.ca/∼jingyang/TR.pdf〉.
51. J. Yang, S. Liao, M. Pawlak, New winning and losing positions for 7 × 7 Hex, in: Computers and Games, Lecture Notes in Computer Science, vol. 2883, Springer, Berlin, 2002, pp. 230-248.