论文信息 - A Move Generating Algorithm for Hex Solvers

A Move Generating Algorithm for Hex Solvers

Generating good move orderings when searching for solutions to games can greatly increase the efficiency of game solving searches. This paper proposes a move generating algorithm for the board game called Hex, which in contrast to many other approaches, determines move orderings from knowledge gained during the search. This move generator has been used in Hex searches solving the 6x6 Hex board with comparative results indicating a significant improvement in performance. One anticipates this move generator will be advantageous in searches for complete solutions of Hex boards, equal to, and larger than, the 7x7 Hex board.

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

[2] Jack van Rijswijck. Search and evaluation in Hex , 2002 .

[3] Frédéric Maire,et al. An Extension of the H-Search Algorithm for Artificial Hex Players , 2004, Australian Conference on Artificial Intelligence.

[4] Martin Müller. Not Like Other Games -- Why Tree Search in Go is Different , 2000 .

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

[6] Jack van Rijswijck. Are Bees Better than Fruitflies? , 2000, Canadian Conference on AI.

[7] Bruce Abramson,et al. Control strategies for two-player games , 1989, CSUR.

[8] Vadim V. Anshelevich,et al. A hierarchical approach to computer Hex , 2002, Artif. Intell..

[9] Vadim V. Anshelevich,et al. The Game of Hex: An Automatic Theorem Proving Approach to Game Programming , 2000, AAAI/IAAI.

[10] Paul Scott. The Game of Hex. , 2007 .

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

[12] A. Reinefeld. A Minimax Algorithm Faster than Alpha - Beta , 1994 .