Enhancing Hex Strategy: AI Based Two-Distance Pruning Approach with Pattern-Enhanced Alpha-Beta Search

This paper introduces an effective algorithm designed for creating AI systems for the Hex board strategy game. The core algorithm, developed, employs the two-distance method for both board evaluation and for sorting of the moves. For empty board positions, the sum of two-distances from both ends is calculated to indicate the position’s weight and is used for sorting. Additionally, the Pattern Search algorithm enhances efficiency by prioritizing moves in crucial regions. The algorithm demonstrated consistent performance across various board sizes, including 7 × 7, 9 × 9, and 11 × 11. When implemented as an Android game, this algorithm maintained excellent performance in the given board sizes.