When solving k-in-a-Row games, the Hales-Jewett pairing strategy is a well-known strategy to prove that specific positions are (at most) a draw. It requires two empty squares per possible winning line (group) to be marked, i.e., with a coverage ratio of 2.0.
In this paper we present a new strategy, called Set Matching. A matching set consists of a set of nodes (the markers), a set of possible winning lines (the groups), and a coverage set indicating how all groups are covered after every first initial move. This strategy needs less than two markers per group. As such it is able to prove positions in k-in-a-Row games to be draws, which cannot be proven using the Hales-Jewett pairing strategy.
We show several efficient configurations with their matching sets. These include Cycle Configurations, BiCycle Configurations, and PolyCycle Configurations involving more than two cycles. Depending on configuration, the coverage ratio can be reduced to 1.14.
Many examples in the domain of solving k-in-a-Row games are given, including the direct proof (not based on search) that the empty \(4 \times 4\) board is a draw for 4-in-a-Row.
Matching Set Polycyclic Configurations Cycle Configuration Coverage Ratio Empty Squares
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.
This is a preview of subscription content, log in to check access.