Abstract
Gradual Abstract Proof Search (GAPS) is a new 2-player search technique. It has been used to prove that 11×11 Phutball is a win for the first player in 25 plies or fewer, and that 6×6 Atari-Go with a crosscut in the centre is a win for the first player in 15 plies or fewer. In the paper, I give domain-dependent optimizations for the two games. Moreover, I describe theoretical and experimental comparisons with other related algorithms.
Get full access to this article
View all access options for this article.
