A Move Generating Algorithm for Hex Solvers | Zendy

Rune Rasmussen | Zendy; Frédéric Maire | Zendy; Ross Hayward | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A Move Generating Algorithm for Hex Solvers

Author(s) -

Rune Rasmussen,

Frédéric Maire,

Ross Hayward

Publication year - 2006

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

ISBN - 3-540-49787-0

DOI - 10.1007/11941439_68

Subject(s) - computer science , algorithm , parallel computing , theoretical computer science

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\udmove 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 signifcant 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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research