Solving 8x8 Hex

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2009, Pages 505-510

  Henderson, Philip ^a   Arneson, Broderick ^a   Hayward, Ryan B ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

SEARCH SPACES;

ARTIFICIAL INTELLIGENCE;

EID: 74349128178     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. Vadim Anshelevich. A hierarchical approach to computer Hex. Artificial Intelligence, 134:101-120, 2000.
2. Yngvi Björnsson, Ryan Hayward, Michael Johanson, and Jack van Rijswijck. Dead Cell Analysis in Hex and the Shannon Game. In Adrian Bondy, Jean Fonlupt, Jean-Luc Fouquet, Jean-Claude Fournier, and Jorge L. R̃amirez Alfonsin, editors, Graph Theory in Paris: Proceedings of a Conference in Memory of Claude Berge (GT04 Paris), pages 45-60. Birkhäuser, 2007.
3. Cameron Browne. Hex Strategy: Making the Right Connections. A. K. Peters, Natick, Massachusetts, 2000.
4. Ryan B. Hayward, Yngvi Björnsson, Michael Johanson, Morgan Kan, Nathan Po, and Jack van Rijswijck. Solving 7 x 7 Hex with domination, fill-in, and virtual connections. Theoretical Computer Science, 349:123-139, 2005.
5. Piet Hein. Vil de laere Polygon? Article in Politiken newspaper, 26 December 1942.
6. Philip Henderson and Ryan B. Hayward. Probing the 4-3-2 edge template in Hex. In H. Jaap van den Herik, Xinhe Xu, Zongmin Ma, and Mark H. M. Winands, editors, Computers and Games (6th International Conference, CG 2008, Beijing, China, September 29 - October 1, 2008. Proceedings), volume 5131 of Lecture Notes in Computer Science, pages 229-240. Springer, 2008.
7. David King. The game of Hex: templates. www.drking.plus.com/hexagons/hex/ templates.html, 2001.
8. Gábor Melis. Six webpage, 2003. six.retes.hu.
9. KenMishima, Hidetoshi Sakurai, and Kohei Noshita. New proof techniques and their applications to winning strategies in Hex. Proceedings of 11th Game Programming Workshop in Japan, pages 136-142, 2006.
10. John Nash. Some Games and Machines for Playing Them. Technical Report D-1164, Rand Corp., 1952.
11. Kohei Noshita. Union-Connections and Straightforward Winning Strategies in Hex. International Computer Games Association Journal, 28(1):3-12, March 2005.
12. Rune K. Rasmussen, Frederic D. Maire, and Ross F. Hayward. A template matching table for speeding-up game-tree searches for Hex. In AI 2007: Advances in Artificial Intelligence, Lecture Notes in Computer Science, pages 283-292. Springer, Berlin/Heidelberg, 2007.
13. Rune Rasmussen. Algorithmic Approaches for Playing and Solving Shannon Games. PhD thesis, Queensland University of Technology, Brisbane, Australia, 2008.
14. Stefan Reisch. Hex ist PSPACE-vollständig. Acta Informatica, 15:167-191, 1981.
15. H.J. van den Herik, J.W.H.J. Uiterwijk, and J. van Rijswijck. Games solved: Now and in the future. Artificial Intelligence, 134(1-2):277-311, 2002.
16. Jack van Rijswijck. Search and evaluation in Hex. Technical report, University of Alberta, 2003. www.javhar.net/javharpublications.
17. Jing Yang. Hex 8x8 solution, 2002. www.ee.umanitoba.ca/~jingyang/hex88-1. html.
18. Jing Yang. Hex 9x9 solution, 2003. www.ee.umanitoba.ca/~jingyang.