Advertisement

A Move Generating Algorithm for Hex Solvers

  • Rune Rasmussen
  • Frederic Maire
  • Ross Hayward
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4304)

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.

Keywords

Pattern Search Move Generator Empty Cell Game Tree Mode Colour 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    van Rijswijck, J.: Computer Hex: Are Bees Better than Fruitflies? Master of science, University of Alberta (2000)Google Scholar
  2. 2.
    Hayward, R., Björnsson, Y., Johanson, M., Kan, M., Po, N., Rijswijck, J.V.: Advances in Computer Games: Solving 7x7 HEX: Virtual Connections and Game-State Reduction. IFIP International Federation of Information Processing, vol. 263. Kluwer Achedemic Publishers, Boston (2003)Google Scholar
  3. 3.
    Hayward, R., Björnsson, Y., Johanson, M., Po, N., Rijswijck, J.v.: Solving 7x7 hex with domination, fill-in, and virtual connections. In: Theoretical Computer Science, Elsevier, Amsterdam (2005)Google Scholar
  4. 4.
    Reinefeld, A.: A minimax algorithm faster than alpha-beta. In: van den Herik, H., Herschberg, I., Uiterwijk, J. (eds.) Advances in Computer Chess, University of Limburg, vol. 7, pp. 237–250 (1994)Google Scholar
  5. 5.
    Müller, M.: Not like other games - why tree search in go is different. In: Fifth Joint Conference on Information Sciences, pp. 974–977 (2000)Google Scholar
  6. 6.
    Abramson, B.: Control strategies for two player games. ACM Computing Survey 21(2), 137–161 (1989)CrossRefMathSciNetGoogle Scholar
  7. 7.
    van Rijswijck, J.: Search and Evaluation in Hex. Master of science, University of Alberta (2002)Google Scholar
  8. 8.
    Gardener, M.: The game of hex. In: The Scientific American Book of Mathematical Puzzles and Diversions, Simon and Schuster, New York (1959)Google Scholar
  9. 9.
    Anshelevich, V.V.: An automatic theorem proving approach to game programming. In: Proceedings of the Seventh National Conference of Artificial Intelligence, pp. 194–198. AAAI Press, Menlo Park (2000)Google Scholar
  10. 10.
    Anshelevich, V.V.: A hierarchical approach to computer hex. Artificial Intelligence 134, 101–120 (2002)MATHCrossRefGoogle Scholar
  11. 11.
    Yang, J., Liao, S., Pawlak, M.: On a Decomposition Method for Finding Winning Strategies in Hex game. Technical, University of Manitoba (2001)Google Scholar
  12. 12.
    Rasmussen, R., Maire, F.: An extension of the h-search algorithm for artificial hex players. In: Australian Conference on Artificial Intelligence, Springer, pp. 646–657 (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Rune Rasmussen
    • 1
  • Frederic Maire
    • 1
  • Ross Hayward
    • 1
  1. 1.Faculty of Information TechnologyQueensland University of TechnologyBrisbaneAustralia

Personalised recommendations