Abstract
Local search in the game of Go is easier if local areas have well-defined boundaries. An artificial boundary consists of temporarily added stones that close off an area. This paper describes a new general framework for finding boundaries in a way such that existing local search methods can be used. Furthermore, by using a revised local UCT search method, it is shown experimentally that this framework increases performance on local Go problems with open boundaries.
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
Cazenave, T.: A generalized threats search algorithm. In: Schaeffer, J., Müller, M., Björnsson, Y. (eds.) CG 2002. LNCS, vol. 2883, pp. 75–87. Springer, Heidelberg (2002)
Fotland, D.: Learning: Chess programs versus Go programs. Computer Go Mailing List (2004)
Gelly, S., Silver, D.: Combining online and offline knowledge in UCT. In: International Conference on Machine Learning (ICML 2007) (2007)
Gelly, S., Wang, Y., Munos, R., Teytaud, O.: Modifications of UCT with patterns in Monte-Carlo Go. Technical Report 6062, INRIA (2006)
GNU Go webpage, http://www.gnu.org/software/gnugo/ .
Kishimoto, A., Müller, M.: Df-pn in Go: An application to the one-eye problem. In: Advances in Computer Games, vol. 10, pp. 125–141. Kluwer Academic Publishers, Dordrecht (2003)
Kishimoto, A., Müller, M.: Search versus knowledge for solving life and death problems in Go. In: Twentieth National Conference on Artificial Intelligence (AAAI 2005), pp. 1374–1379 (2005)
Kocsis, L., Szepesvári, C.: Bandit based Monte-Carlo planning. In: Fürnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) ECML 2006. LNCS (LNAI), vol. 4212, pp. 282–293. Springer, Heidelberg (2006)
Müller, M.: Race to capture: Analyzing semeai in Go. In: Game Programming Workshop in Japan 1999, vol. 99(14). IPSJ Symposium Series, pp. 61–68, Tokyo, Japan (1999)
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)
Wolf, T.: Gotools webpage, http://lie.math.brocku.ca/GoTools/
Wolf, T.: Forward pruning and other heuristic search techniques in tsume Go. Special issue of Information Sciences 122(1), 59–76 (2000)
Zhao, L., Müller, M.: Solving probabilistic combinatorial games. In: van den Herik, H.J., Hsu, S.-C., Hsu, T.-s., Donkers, H.H.L.M(J.) (eds.) CG 2005. LNCS, vol. 4250, pp. 225–238. Springer, Heidelberg (2006)
Zhao, L., Müller, M.: Artificial boundary test set for Go (2008), http://www.cs.ualberta.ca/~games/go/abtest.zip
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhao, L., Müller, M. (2008). Using Artificial Boundaries in the Game of Go. In: van den Herik, H.J., Xu, X., Ma, Z., Winands, M.H.M. (eds) Computers and Games. CG 2008. Lecture Notes in Computer Science, vol 5131. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87608-3_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-87608-3_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87607-6
Online ISBN: 978-3-540-87608-3
eBook Packages: Computer ScienceComputer Science (R0)