Abstract
Probabilistic combinatorial games (PCGs) are a model for Go-like games recently introduced by Ken Chen. They differ from normal combinatorial games since terminal positions in each subgame are evaluated by a probability distribution. The distribution expresses the uncertainty in the local evaluation. This paper focuses on the analysis and solution methods for a special case, 1-level binary PCGs. Monte-Carlo analysis is used for move ordering in an exact solver that can compute the winning probability of a PCG efficiently. Monte-Carlo interior evaluation is used in a heuristic player. Experimental results show that both types of Monte-Carlo methods work very well in this problem.
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
Abramson, B.: Expected-outcome: A General Model of Static Evaluation. IEEE transactions on PAMI 12, 182–193 (1990)
Baum, E., Smith, W.: A Bayesian Approach to Relevance in Game-Playing. Artificial Intelligence 97(1-2), 195–242 (1997)
Berlekamp, E.R., Conway, J.H., Guy, R.K.: Winning Ways for your Mathematical Plays. Academic Press, London (1982)
Billings, D., Davidson, A., Schaeffer, J., Szafron, D.: The Challenge of Poker. Artificial Intelligence 134(1-2), 201–240 (2002)
Bouzy, B.: Associating Shallow and Selective Global Tree Search with Monte Carlo for 9x9 Go. In: van den Herik, H.J., Björnsson, Y., Netanyahu, N.S. (eds.) CG 2004. LNCS, vol. 3846, pp. 67–80. Springer, Heidelberg (2006)
Bouzy, B., Helmstetter, B.: Monte Carlo Go Developments. In: van den Herik, H.J., Iida, H., Heinz, E.A. (eds.) Advances in Computer Games conference (ACG-10), pp. 159–174. Kluwer Academic Publishers, Boston (2003)
Chen, K.: Maximizing the Chance of Winning in Searching Go Game Trees. Information Sciences 175(4), 273–283 (2005)
Müller, M.: Computer Go as a Sum of Local Games: An Application of Combinatorial Game Theory. PhD thesis, ETH Zürich, Diss. ETH Nr. 11.006 (1995)
Müller, M.: Partial Order Bounding: A New Approach to Evaluation in Game Tree Search. Artificial Intelligence 129(1-2), 279–311 (2001)
Palay, A.: Search with Probabilities. Morgan Kaufmann, San Francisco (1985)
Schaeffer, J.: The History Heuristic and the Performance of Alpha-Beta Enhancements. IEEE Transactions on Pattern Analysis and Machine Intelligence 11(11), 1203–1212 (1989)
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
Zhao, L., Müller, M. (2006). Solving Probabilistic Combinatorial Games. 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_17
Download citation
DOI: https://doi.org/10.1007/11922155_17
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)