Abstract
Solving board games is a hard task, in particular for games in which classical tools such as alpha-beta and proof-number-search are somehow weak. In particular, Go is not solved (in any sense of solving, even the weakest) beyond 6x6. We here investigate the use of Meta-Monte-Carlo-Tree-Search, for building a huge 7x7 opening book. In particular, we report the twenty wins (out of twenty games) that were obtained recently in 7x7 Go against pros; we also show that in one of the games, with no human error, the pro might have won.
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
Allis, L.V.: Searching for solutions in games and artificial intelligence. Ph.D. dissertation, The Netherlands: University of Limburg (1994)
Audouard, P., Chaslot, G., Hoock, J.-B., Perez, J., Rimmel, A., Teytaud, O.: Grid Coevolution for Adaptive Simulations: Application to the Building of Opening Books in the Game of Go. In: Giacobini, M., Brabazon, A., Cagnoni, S., Di Caro, G.A., Ekárt, A., Esparcia-Alcázar, A.I., Farooq, M., Fink, A., Machado, P. (eds.) EvoWorkshops 2009. LNCS, vol. 5484, pp. 323–332. Springer, Heidelberg (2009)
Bellman, R.: Dynamic Programming. Princeton Univ. Press (1957)
Berthier, V., Doghmen, H., Teytaud, O.: Consistency Modifications for Automatically Tuned Monte-Carlo Tree Search. In: Blum, C., Battiti, R. (eds.) LION 4. LNCS, vol. 6073, pp. 111–124. Springer, Heidelberg (2010)
Cazenave, T., Saffidine, A.: Score Bounded Monte-Carlo Tree Search. In: van den Herik, H.J., Iida, H., Plaat, A. (eds.) CG 2010. LNCS, vol. 6515, pp. 93–104. Springer, Heidelberg (2011)
Cazenave, T.: Nested monte-carlo search. In: IJCAI, pp. 456–461 (2009)
Chaslot, G., Winands, M., Uiterwijk, J., van den Herik, H., Bouzy, B.: Progressive Strategies for Monte-Carlo Tree Search. In: Wang, P., et al. (eds.) Proceedings of the 10th Joint Conference on Information Sciences (JCIS 2007), pp. 655–661. World Scientific Publishing Co. Pte. Ltd., Singapore (2007),papers\pMCTS.pdf
Coulom, R.: Efficient Selectivity and Backup Operators in Monte-Carlo Tree Search. In: van den Herik, H.J., Ciancarini, P., Donkers, H.H.L.M(J.) (eds.) CG 2006. LNCS, vol. 4630, pp. 72–83. Springer, Heidelberg (2007)
Davies, J.: 7x7 go. American GO Journal 29(3), 11 (1995)
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)
Lee, C.-S., Wang, M.-H., Chaslot, G., Hoock, J.-B., Rimmel, A., Teytaud, O., Tsai, S.-R., Hsu, S.-C., Hong, T.-P.: The Computational Intelligence of MoGo Revealed in Taiwan’s Computer Go Tournaments. IEEE Transactions on Computational Intelligence and AI in Games (2009), http://hal.inria.fr/inria-00369786/en/
Méhat, J., Cazenave, T.: Combining uct and nested monte carlo search for single-player general game playing. IEEE Trans. Comput. Intellig. and AI in Games 2(4), 271–277 (2010)
Saito, J.-T., Chaslot, G., Uiterwijk, J.W.H.M., Van Den Herik, H.J.: Monte-Carlo Proof-Number Search for Computer Go. In: van den Herik, H.J., Ciancarini, P., Donkers, H.H.L.M(J.) (eds.) CG 2006. LNCS, vol. 4630, pp. 50–61. Springer, Heidelberg (2007)
Sensei website, http://senseis.xmp.net/?7x7BestPlay
Tromp website, http://www.cwi.nl/~tromp/java/go/7x7.sgf
van der Werf, E.C.D., Uiterwijk, J.W.H.M., van den Herik, H.J.: Solving ponnuki-go on small boards. In: GAME-ON (2002)
van der Werf, E.C.D., Winands, M.H.M.: Solving go for rectangular boards. ICGA Journal 32(2), 77–88 (2009)
Zermelo, E.: Uber eine anwendung der mengenlehre auf die theorie des schachspiels. In: Proc. Fifth Congress Mathematicians, pp. 501–504. Cambridge University Press
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chou, CW. et al. (2012). Towards a Solution of 7x7 Go with Meta-MCTS. In: van den Herik, H.J., Plaat, A. (eds) Advances in Computer Games. ACG 2011. Lecture Notes in Computer Science, vol 7168. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31866-5_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-31866-5_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31865-8
Online ISBN: 978-3-642-31866-5
eBook Packages: Computer ScienceComputer Science (R0)