Abstract
Most Go-playing programs use a combination of search and heuristics based on an influence function to determine whether territories are safe. However, to assure the correct evaluation of Go positions, the safety of stones and territories must be proved by an exact method.
The first exact algorithm, due to Benson [1], determines the unconditional safety of stones and completely surrounded territories. Müller [3] develops static rules for detecting safety by alternating play, and introduces search-based methods.
This paper describes new, stronger search-based techniques including region-merging and a new method for efficiently solving weakly dependent regions. In a typical final position, more than half the points on the board can be proved safe by our current solver. This almost doubles the number of proven points compared to the 26.4% reported in [3].
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Benson, D.B.: Life in the game of Go. Information Sciences 10, 17–29 (1976); Levy, D.N.L. (ed.): Reprinted in Computer Games, vol. II, pp. 203–213. Springer, Heidelberg (1988)
MÄuller, M.: Computer Go as a Sum of Local Games: An Application of Combinatorial Game Theory. PhD thesis, ETH ZÄurich, Diss. ETH Nr. 11.006 (1995)
MÄuller, M.: Playing it safe: Recognizing secure territories in computer Go by using static rules and search. In: Matsubara, H. (ed.) Game Programming Workshop in Japan 1997, pp. 80–86. Computer Shogi Association, Tokyo (1997)
Nagai, A.: Df-pn Algorithm for Searching AND/OR Trees and Its Applications. PhD thesis, University of Tokyo (2002)
Niu, X.: Recognizing safe territories and stones in computer Go. Master’s thesis, University of Alberta, in preparation (2004)
van der Werf, E., van den Herik, H.J., Uiterwijk, J.W.H.M.: Learning to score final positions in the game of Go. In: van den Herik, H.J., Iida, H., Heinz, E.A. (eds.) Advances in Computer Games, vol. 10, pp. 143–158. Kluwer, Dordrecht (2004)
Vilá, R., Cazenave, T.: When one eye is suficient: a static classification. In: van den Herik, H.J., Iida, H., Heinz, E.A. (eds.) Advances in Computer Games, vol. 10, pp. 109–124. Kluwer, Dordrecht (2004)
Winands, M.H.M., Uiterwijk, J.W.H.M., van den Herik, H.J.: An effective two- level proof-number search algorithm. Theoretical Computer Science 313(3), 511–525 (2004)
Wolf, T.: The program GoTools and its computer-generated tsume go database. In: Matsubara, H. (ed.) Game Programming Workshop in Japan 1994, pp. 84–96. Computer Shogi Association, Tokyo (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Niu, X., Müller, M. (2006). An Improved Safety Solver for Computer Go. In: van den Herik, H.J., Björnsson, Y., Netanyahu, N.S. (eds) Computers and Games. CG 2004. Lecture Notes in Computer Science, vol 3846. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11674399_7
Download citation
DOI: https://doi.org/10.1007/11674399_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-32488-1
Online ISBN: 978-3-540-32489-8
eBook Packages: Computer ScienceComputer Science (R0)