This page provides a list of useful reference material about the game of Hex and artificial Hex players.

1. Anshelevich, V. V. (2000). An Automatic Theorem Proving Approach to Game Programming. Paper presented at the Proceedings of the Seventh National Conference of Artificial Intelligence, Menlo Park, California.

2. Anshelevich, V. V. (2002). A Hierarchical Approach to Computer Hex. Artificial Intelligence, 134, 101-120.

3. Cazenave, T. (2001). Retrograde Analysis Of Patterns Versus Metaprogramming. Université Paris 8, Saint Denis.

4. Duffin, W. J. (1990). Electricity and Magnetism. In (4th ed., pp. 46-81). London: McGraw-Hill.

5. Even, S., Tarjan R.E. (1976). A Combinatorial Problem Which is Complete in Polynomial Space. Journal of the Association for Computing Machinery, 23(4), 710-719.

6. Gardener, M. (1959). The Game of Hex. In The Scientific American Book of Mathematical Puzzles and Diversions. New York: Simon and Schuster.

7. Hayward, R., Björnsson, Y., Johanson, M., Kan M., Po, N., Van Rijswijck, J. (2003). Advances in Computer Games: Solving 7x7 HEX: Virtual Connections and Game-State Reduction (Vol. 263). Boston: Kluwer Achedemic Publishers.

8. Mansfield, R. (1996). Strategies for the Shannon Switching Game. American Mathematical Monthly, 103(3), 250-252.

9. Müller, M. (2001). Global and local game tree search. Information Sciences, 135(3-4), 187-206.

10. Russell, S., Norvig, P. (2003). Artificial Intelligence a Modern Approach (Second ed.). New Jersey: Pearson Education.

11. Van Rijswijck, J. (2002a). Are Bees Better Than Fruitflies? Unpublished Masters, University of Alberta, Edmonton.

12. Van Rijswijck, J. (2002b). Search and Evaluation in Hex. Unpublished Technical, University of Alberta, Edmonton.

13. Yang, J., Liao S., Pawlak, M. (2001). On a Decomposition Method for Finding Winning Strategies in Hex game. Unpublished Technical, University of Manitoba, Manitoba.  

[ Home ]

Last Modified: 12/12/2006