DF-PN in Go: An application to the one-eye problem

Abstract

Search algorithms based on the notion of proof and disproof numbers have been shown to be effective in many games. In this paper, we modify the depth-first proof-number search algorithm df-pn, in order to apply it to the game of Go. We develop a solver for one-eye problems, a special case of enclosed tsume-Go [life and death] problems. Our results show that this approach is very promising. © 2004 by Springer Science+Business Media New York.