Abstract
Combinatorial games pose an extreme challenge to combinatorial optimization. Several combinatorial games have been shown to be PSPACE-hard and many more are believed to be so. In this paper, we present a new approach to analyzing combinatorial games, which differs dramatically from current approaches. Using the combinatorial game Chomp as a model system, we employ ideas from physics and dynamical systems theory to unveil deep connections between such games and nonlinear phenomena commonly seen in nature.
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
Berlekamp, E.R., Conway, J.H., Guy, R.K.: Winning Ways for Your Mathematical Plays. Academic Press, London (1982)
Nowakowski, R.J.: Games of No Chance. Cambridge University Press, Cambridge (1996)
Nowakowski, R.J.: More Games of No Chance. Cambridge University Press, Cambridge (2002)
Fleischer, R.H., Nowakowski, R.J.: Algorithmic combinatorial game theory. Elsevier, Amsterdam (2004)
Berlekamp, E.: The Game of Dots and Boxes - sophisticated child’s play. A K Peters Ltd, Natick, MA (2000)
Berlekamp, E., Wolfe, D.: Mathematical Go: Chilling Gets the Last Point. A K Peters Ltd, Natick, MA (1994)
Demaine, E.D.: Playing games with algorithms: Algorithmic combinatorial game theory. In: Sgall, J., Pultr, A., Kolman, P. (eds.) MFCS 2001. LNCS, vol. 2136, Springer, Heidelberg (2001)
Fraenkel, A.S.: Complexity, appeal and challenges of combinatorial games. Theoretical Computer Science 313, 393–415 (2004)
Demaine, E.D., Fleischer, R., Fraenkel, A.S., Nowakowski, R.J.: Open problems at the 2002 Dagstuhl Seminar on Algorithmic combinatorial game theory. Theoretical Computer Science 313, 539–543 (2004)
Guy, R., Nowakowski, R.: Unsolved Problems in Combinatorial Games. In: Nowakowski, R.J. (ed.) More Games of No Chance, Cambridge University Press, Cambridge (2002)
Sprague, R.: Uber mathematische Kampfspiele. Tohoku Mathematical Journal 41, 438–444 (1936)
Grundy, P.M.: Mathematics and games. Eureka 2, 6–8 (1939)
Smith, C.: Graphs and composite games. Journal of Combinatorial Theory 1, 51–81 (1966)
Conway, J.H.: On Numbers and Games. AK Peters Ltd., Natick, Mass (2000)
Newborn, M.: Kasparov versus Deep Blue: Computer Chess Comes of Age. Springer, New York (1997)
Schaeffer, J.: One Jump Ahead: Challenging Human Supremacy in Checkers. Springer, New York (1997)
Gale, D.: A Curious Nim-type game. Amer. Math. Monthly 81, 876–879 (1974)
Schuh, F.: Spel van delers. Nieuw Tijdschrift voor Wiskunde 39, 299–304 (1952)
Zeilberger, D.: Three-rowed Chomp. Adv. in Appl. Math. 26, 168–179 (2001)
Zeilberger, D.: Chomp, Recurrences, and Chaos. J. Difference Equations and its Applications 10, 1281–1293 (2004)
Sun, X.: Improvements on Chomp. Integers 2Â G1, 8 (2002), http://www.integers-ejcnt.org/
Byrnes, S.: Poset Games Periodicity. Integers 3Â G3, 8 (2003), http://www.integers-ejcnt.org/
Brouwer, A.E.: The game of Chomp (2004), On-line document http://www.win.tue.nl/~aeb/games/chomp.html
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Friedman, E.J., Landsberg, A.S. (2007). Scaling, Renormalization, and Universality in Combinatorial Games: The Geometry of Chomp. In: Dress, A., Xu, Y., Zhu, B. (eds) Combinatorial Optimization and Applications. COCOA 2007. Lecture Notes in Computer Science, vol 4616. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73556-4_23
Download citation
DOI: https://doi.org/10.1007/978-3-540-73556-4_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73555-7
Online ISBN: 978-3-540-73556-4
eBook Packages: Computer ScienceComputer Science (R0)