Abstract
In a game, pure Monte Carlo search with parameter T means that for each feasible move T random games are generated. The move with the best average score is played. We call a game “Monte Carlo perfect” when this straightforward procedure converges to perfect play for each position, when T goes to infinity. Many popular games like Go, Hex, and Amazons are NOT Monte Carlo perfect.
In this paper, two-player zero-sum games are investigated where the turn-order is random: always a fair coin flip decides which player acts in the next move. A whole class of such random-turn games is proven to be Monte Carlo perfect. The result and generalisations are discussed, with example games ranging from very abstract to very concrete.
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
Althöfer, I.: On the Laziness of Monte-Carlo Game Tree Search in Non-Tight Situations. Technical report (2008), http://www.althofer.de/mc-laziness.pdf
Althöfer, I.: Game Self-Play with Pure Monte-Carlo: the Basin Structure. Technical report (2010), http://www.althofer.de/monte-carlo-basins-althoefer.pdf
Althöfer, I.: Rules and Sample Match of the Game OdOku. Technical report (2011), http://www.althofer.de/odoku.html
Berg, R.H.: Pirate board game, Blackbeard. Avalon Hill Company (1991), evaluated, http://www.boardgamegeek.com/boardgame/235/blackbeard (accessed on August 01, 2011)
Browne, C.: Connection Games: Variations on a Theme. AK Peters, Massachusetts (2005)
Browne, C.: On the Dangers of Random Playouts. ICGA Journal 34, 25–26 (2011)
Brügmann, B.: Monte Carlo Go. Unpublished Report (1993), but online available at several places, for instance at http://www.althofer.de/Bruegmann-MonteCarloGo.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)
Fishman, G.S.: Monte Carlo: Concepts, Algorithms, and Applications. Springer, New York (1995)
Hammersley, J.M., Handscomb, D.C.: Monte Carlo Methods. Methuen, London (1975)
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)
Peres, Y., Schramm, O., Sheffield, S., Wilson, D.B.: Random-Turn Hex and other Selection Games. American Mathematical Monthly 114, 373–387 (2007)
Tromp, J.: John’s Connect Four Playground, http://homepages.cwi.nl/~tromp/c4/c4.html (last accessed on August 06, 2011)
Wilson, D.B.: Hexamania - Computer Program for Playing Random-Turn Hex, Random-Turn Tripod, and the Harmonic Explorer Game (2005), http://dbwilson.com/hex/
Yang, Y., Zhou, S.G., Li, Y.: Square++: Making a Connection Game Win-Lose Complementary, Free Deadlock and Playing-Fair. Technical Report, School of Computer Science, Fudan University (2010)
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
Althöfer, I. (2012). On Board-Filling Games with Random-Turn Order and Monte Carlo Perfectness. 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_22
Download citation
DOI: https://doi.org/10.1007/978-3-642-31866-5_22
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)