Automatic Strategy Verification for Hex

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.

[1]  Jing Yang,et al.  New Winning and Losing Positions for 7x7 HEx , 2002, Computers and Games.

[2]  Stefan Reisch,et al.  Hex ist PSPACE-vollständig , 1981, Acta Informatica.

[3]  Kohei Noshita.  Union-Connections and Straightforward Winning Strategies in Hex , 2005, J. Int. Comput. Games Assoc..

[4]  Ryan B. Hayward,et al.  Solving 7x7 Hex with domination, fill-in, and virtual connections , 2005, Theor. Comput. Sci..

[5]  A. Bakst,et al.  The Second Scientific American Book of Mathematical Puzzles and Diversions. , 1962 .

[6]  Jorge Nuno Silva,et al.  Mathematical Games , 1959, Nature.

[7]  Zongmin Ma,et al.  Computers and Games , 2008, Lecture Notes in Computer Science.

[8]  Ryan B. Hayward,et al.  Solving 7x7 Hex: Virtual Connections and Game-State Reduction , 2003, ACG.

[9]  M. Charles.  A Beautiful Mind , 2003, American journal of psychoanalysis.

[10]  Ryan B. Hayward,et al.  Hex and combinatorics , 2006, Discret. Math..