Abstract
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. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Rasmussen, R., Maire, F., & Hayward, R. (2006). A move generating algorithm for hex solvers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4304 LNAI, pp. 637–646). Springer Verlag. https://doi.org/10.1007/11941439_68
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
