GRADUAL ABSTRACT PROOF SEARCH

Article type: Research Article

Authors: Cazenave, Tristan^{; 1}

Affiliations: Paris, France

Note: [1] Labo IA, Université Paris 8, 2 rue de la Libertć, 93526, St-Denis. France. Email: cazenave@aj.univ-paris8.fr

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.

DOI: 10.3233/ICG-2002-25102

Journal: ICGA Journal, vol. 25, no. 1, pp. 3-15, 2002