Abstract
There are two complementary approaches to playing sums of combinatorial games. They can be characterized as local analysis and global search. Algorithms from combinatorial game theory such as Hotstrat and Thermostrat [2] exploit summary information about each subgame such as its temperature or its thermograph. These algorithms can achieve good play, with a bounded error. Their runtime depends mainly on the complexity of analyzing individual subgames. Most importantly, it is not exponential in global parameters such as the branching factor and the number of moves in the sum game. One problem of these classic combinatorial game algorithms is that they cannot exploit extra available computation time.
A global minimax search method such as αβ can determine the optimal result of a sum game. However, the solution cost grows exponentially with the total size of the sum game, even if each subgame by itself is simple. Such an approach does not exploit the independence of subgames.
This paper explores combinations of both local and global-level analysis in order to develop locally informed global search algorithms for sum games. The algorithms utilize the subgame structure in order to reduce the runtime of a global αβ search by orders of magnitude. In contrast to methods such as Hotstrat and Thermostrat, the new algorithms exhibit improving solution quality with increasing time limits.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Berlekamp, E.: The economist’s view of combinatorial games. In: Nowakowski, R. (ed.) Games of No Chance: Combinatorial Games at MSRI, pp. 365–405. Cambridge University Press, Cambridge (1996)
Berlekamp, E., Conway, J., Guy, R.: Winning Ways. Academic Press, London (1982) Revised version published 2001-2004 by AK Peters
Berlekamp, E., Wolfe, D.: Mathematical Go: Chilling Gets the Last Point. A K Peters, Wellesley (1994)
Cazenave, T.: Comparative evaluation of strategies based on the values of direct threats. In: Board Games in Academia V, Barcelona (2002)
Moews, D.J.: On Some Combinatorial Games Connected with Go. PhD thesis, University of California at Berkeley (1993)
Müller, M.: Decomposition search: A combinatorial games approach to game tree search, with applications to solving Go endgames. In: IJCAI 1999, pp. 578–583 (1999)
Müller, M.: Global and local game tree search. Information Sciences 135(3–4), 187–206 (2001)
Spight, W.: Go thermography - the 4/21/98 Jiang-Rui endgame. In: Nowakowski, R. (ed.) More Games of No Chance, pp. 89–105. Cambridge University Press, Cambridge (2002)
Wolfe, D.: Go endgames are PSPACE-hard. In: Nowakowski, R. (ed.) More Games of No Chance, pp. 125–136. Cambridge University Press, Cambridge (2002)
Yedwab, L.: On playing well in a sum of games. Master’s thesis. MIT, MIT/LCS/TR-348 (1985)
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
Müller, M., Li, Z. (2006). Locally Informed Global Search for Sums of Combinatorial Games. In: van den Herik, H.J., Björnsson, Y., Netanyahu, N.S. (eds) Computers and Games. CG 2004. Lecture Notes in Computer Science, vol 3846. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11674399_19
Download citation
DOI: https://doi.org/10.1007/11674399_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-32488-1
Online ISBN: 978-3-540-32489-8
eBook Packages: Computer ScienceComputer Science (R0)