Abstract
Monte-Carlo algorithms and their UCT-like successors have recently shown remarkable promise for Go-playing programs. We apply some of these same algorithms to an Amazons-playing program. Our experiments suggest that a pure MC/UCT type program for playing Amazons has little promise, but by using strong evaluation functions we are able to create a hybrid MC/UCT program that is superior to both the basic MC/UCT program and the conventional minimax-based programs. The MC/UCT program is able to beat Invader, a strong minimax program, over 80% of the time at tournament time controls.
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
Avetisyan, H., Lorentz, R.: Selective Search in an Amazons Program. In: Schaeffer, J., Müller, M., Björnsson, Y. (eds.) CG 2002. LNCS, vol. 2883, pp. 123–141. Springer, Heidelberg (2003)
Brügmann, B.: Monte Carlo Go. Technical report, Physics Department, Syracuse University (1993)
Cazenave, T.: Iterative widening. In: In 17th International Joint Conference on Artificial Intelligence (IJCAI 2001), pp. 523–528 (2001)
Chaslot, G.M.J.-B., Winands, M.H.M., Uiterwijk, J.W.H.M., van den Herik, H.J., Bouzy, B.: Progressive strategies for Monte-Carlo Tree Search. New Mathematics and Natural Computation 4(3), 343–357 (2008)
Coulom, R.: Efficient selectivity and back-up 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. Springer, Heidelberg (2007)
Coulom, R.: Computing “Elo Ratings” of Move Patterns in the Game of Go. ICGA Journal 30(4), 198–208 (2007)
Drake, P., Uurtamo, S.: Move Ordering vs Heavy Playouts: Where Should Heuristics Be Applied in Monte Carlo Go? In: Proceedings of the 3rd North American Game-On Conference (2007)
Gelly, S., Wang, Y.: Exploration exploitation in Go: UCT for Monte-Carlo Go. In: Twentieth Annual Conference on Neural Information Processing Systems (2006)
Gelly, S., Wang, Y., Munos, R., Teytaud, O.: Modification of UCT for Monte-Carlo Go. Technical Report 6062, INRIA (2006)
Kloetzer, J., Iida, H., Bouzy, B.: The Monte-Carlo approach in Amazons. In: van den Herik, H.J., Uiterwijk, J.W.H.M., Winands, M.H.M., Schadd, M.P.D. (eds.) Computer Games Workshop 2007, Amsterdam, The Netherlands, pp. 185–192 (2007)
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)
Lieberum, J.: An Evaluation Function for the Game of Amazons. Theoretical Computer Science 349(22), 230–244 (2005)
Lorentz, R.: First-time Entry Amazong wins Amazons Tournament. ICGA Journal 25(3), 182–184 (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lorentz, R.J. (2008). Amazons Discover Monte-Carlo. 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_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-87608-3_2
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)