Abstract
Seki is a situation of coexistence in the game of Go, where neither player can profitably capture the opponent’s stones. This paper presents a new method for deciding whether an enclosed area is or can become a seki. The method combines local search with global-level static analysis. Local search is used to identify possible seki, and reasoning on the global level is applied to determine which stones are safe with territory, which coexist in a seki and which are dead. Experimental results show that a safety-of-territory solver enhanced by this method can successfully recognize a large variety of local and global scale test positions related to seki. In contrast, the well-known program GNU Go can only solve easier problems from a test collection.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Allis, L.V., Meulen, M., van den Herik, H.J.: Proof-Number Search. Artificial Intelligence 66(1), 91–124 (1994)
Benson, D.B.: Life in the Game of Go. Information Sciences 10, 17–29 (1976); Reprinted in Levy, D.N.L. (ed.): Computer Games, vol. II, pp. 203–213. Springer, New York (1988)
Campbell, M.: The Graph-History Interaction: On Ignoring Position History. In: Association for Computing Machinery Annual Conference, pp. 278–280 (1985)
Chen, K., Chen, Z.: Static Analysis of Life and Death in the Game of Go. Information Science 121, 113–134 (1999)
Kishimoto, A.: Correct and Efficient Search Algorithms in the Presence of Repetitions. PhD thesis, Department of Computing Science, University of Alberta (2005)
Kishimoto, A., Müller, M.: DF-PN in Go: Application to the One-Eye Problem. In: van den Herik, H.J., Iida, H., Heinz, E.A. (eds.) 10th Advances in Computer Games (ACG10), Many Games, Many Challenges, pp. 125–141. Kluwer Academic Publishers, Boston (2004)
Kishimoto, A., Müller, M.: A General Solution to the Graph History Interaction Problem. In: 19th National Conference on Artificial Intelligence (AAAI 2004), pp. 644–649. AAAI Press, Menlo Park (2004)
Müller, M.: Computer Go as a Sum of Local Games: An Application of Combinatorial Game Theory. PhD thesis, Diss. ETH Nr. 11.006, ETH Zürich (1995)
Müller, 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, Japan (1997)
Müller, M.: Race to Capture: Analyzing Semeai in Go. In: Game Programming Workshop in Japan. IPSJ Symposium Series, vol. 99(14), pp. 61–68 (1999)
Nagai, A.: DF-PN Algorithm for Searching AND/OR Trees and Its Applications. PhD thesis, Department of Information Science, University of Tokyo (2002)
Niu, X., Müller, M.: An Improved Safety Solver for Computer Go. In: van den Herik, H.J., Björnsson, Y., Netanyahu, N.S. (eds.) CG 2004. LNCS, vol. 3846, pp. 97–112. Springer, Heidelberg (2006)
Palay, A.J.: Searching with Probabilities. PhD thesis, Carnegie Mellon University (1983)
Tao, S.: Guan Zi Pu (1689); Reprinted in Shu Rong Qi Yi Chu Ban She. Da Quan, W.Q.J.Q., MingJiu, J., ZhuJiu, J. (eds.), Cheng Du, China (1996)
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.) 10th Advances in Computer Games (ACG10), Many Games, Many Challenges, pp. 143–158. Kluwer Academic Publishers, Boston (2004)
Vilà , R., Cazenave, T.: When One Eye is Sufficient: a Static Classification. In: van den Herik, H.J., Iida, H., Heinz, E.A. (eds.) 10th Advances in Computer Games (ACG10), Many Games, Many Challenges, pp. 109–124. Kluwer Academic Publishers, Boston (2004)
van der Werf, E.: AI Techniques for the Game of Go. PhD thesis, University of Maastricht (2005)
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., Kishimoto, A., Müller, M. (2006). Recognizing Seki in Computer Go. In: van den Herik, H.J., Hsu, SC., Hsu, Ts., Donkers, H.H.L.M.(. (eds) Advances in Computer Games. ACG 2005. Lecture Notes in Computer Science, vol 4250. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11922155_7
Download citation
DOI: https://doi.org/10.1007/11922155_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-48887-3
Online ISBN: 978-3-540-48889-7
eBook Packages: Computer ScienceComputer Science (R0)