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.
Chapter PDF
Similar content being viewed by others
References
Allis, L. V., van der Meulen, M., and van den Herik, H. J. (1994). Proof-number search. Artificial Intelligence, 66 (1): 91–124.
Breuker, D. M., van den Herik, H. J., Uiterwijk, J. W. H. M., and Allis, L. V. (2001). A solution to the GHI problem for best-first search. Theoretical Computer Science, 252 (1–2): 121–149.
Cazenave, T. (2002). Abstract proof search. In Marsland, T. A. and Frank, I., editors, Computersand Games (CG 2000),volume 2063 of Lecture Notes in Computer Science,pages 39–54. Springer.
Chen, K. and Chen, Z. (1999). Static analysis of life and death in the game of Go. Information Sciences, 121: 113–134.
Fotland, D. (2002). Static eye analysis in “The Many Faces of Go”. ICGA Journal,25(4):203210.
Kawano, Y. (1996). Using similar positions to search game trees. In Nowakowski, R. J., editor, Games of No Chance,volume 29 of MSRI Publications,pages 193–202. Cambridge University Press.
Kishimoto, A. and Muller, M. (2003). A solution to the GHI problem for depth-first proof-number search. Manuscript in preparation.
Korf, R. E. (1985). Depth-first iterative deepening: An optimal admissible tree search. Artificial Intelligence, 27 (1): 97–109.
Korf, R. E. (1993). Linear-space best-first search. Artificial Intelligence, 62 (1): 41–78.
Kraszek, J. (1988). Heuristics in the life and death algorithm of a Go-playing program. In Computer Go, volume 9, pages 13–24.
Müller, M. (1997). Playing it safe: Recognizing secure territories in computer Go by using static rules and search. In Matsubara, H., editor, Game Programming Workshop in Japan ‘87, pages 80–86, Tokyo, Japan. Computer Shogi Association.
Nagai, A. (1999). A new depth-first search algorithm for AND/OR trees. Master’s thesis, Department of Information Science, University of Tokyo.
Nagai, A. (2002). Df-pn Algorithm for Searching AND/OR Trees and Its Applications. PhD thesis, Department of Information Science, University of Tokyo.
Palay, A. J. (1985). Searching with Probabilities. PhD thesis, Boston University.
Sakuta, M. (2001). Deterministic Solving of Problems with Uncertainty. PhD thesis, Department of Science and Engineering, Shizuoka University.
Seo, M. (1995). The C* algorithm for AND/OR tree search and its application to a tsume-shogi program. Master’s thesis, Department of Information Science, University of Tokyo.
Tanase, Y. (2000). Algorithms in ISshogi. In Matsubara, H., editor, Advances in Computer Shogi 3, pages 1–14. Kyouritsu Shuppan Press. In Japanese.
Wolf, T. (1994). The program GoTools and its computer-generated tsume Go database. In Matsubara, H., editor, Game Programming Workshop in Japan ‘84, pages 84–96, Tokyo, Japan. Computer Shogi Association.
Wolf, T. (2000). Forward pruning and other heuristic search techniques in tsume Go. Information Sciences, 122 (1): 59–76.
Zobrist, A. L. (1970). A new hashing method with applications for game playing. Technical report, Department of Computer Science, University of Wisconsin, Madison, WI. Republished (1990) in ICCA Journal, 13 (2): 69–73.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 IFIP International Federation for Information Processing
About this chapter
Cite this chapter
Kishimoto, A., Müller, M. (2004). DF-PN in Go: An Application to the One-Eye Problem. In: Van Den Herik, H.J., Iida, H., Heinz, E.A. (eds) Advances in Computer Games. IFIP — The International Federation for Information Processing, vol 135. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35706-5_9
Download citation
DOI: https://doi.org/10.1007/978-0-387-35706-5_9
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-4424-8
Online ISBN: 978-0-387-35706-5
eBook Packages: Springer Book Archive