Combinatorial games pose an extreme challenge to combinatorial optimization. Several combinatorial games have been shown to be PSPACEhard 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. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Friedman, E. J., & Landsberg, A. S. (2007). Scaling, renormalization, and universality in combinatorial games: The geometry of chomp. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4616 LNCS, pp. 200–207). Springer Verlag. https://doi.org/10.1007/978-3-540-73556-4_23
Mendeley helps you to discover research relevant for your work.