Solving Probabilistic Combinatorial Games
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.
KeywordsTerminal Node Depth Limit Terminal Position Interior Node Game Tree
Unable to display preview. Download preview PDF.
- 1.Abramson, B.: Expected-outcome: A General Model of Static Evaluation. IEEE transactions on PAMI 12, 182–193 (1990)Google Scholar
- 6.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)Google Scholar
- 8.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)Google Scholar
- 10.Palay, A.: Search with Probabilities. Morgan Kaufmann, San Francisco (1985)Google Scholar