Scaling, Renormalization, and Universality in Combinatorial Games: The Geometry of Chomp

  • Eric J. Friedman
  • Adam Scott Landsberg
Conference paper

DOI: 10.1007/978-3-540-73556-4_23

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4616)
Cite this paper as:
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

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Eric J. Friedman
    • 1
  • Adam Scott Landsberg
    • 2
  1. 1.School of ORIE, Cornell University, Ithaca, NY 14853USA
  2. 2.Joint Science Department, Claremont McKenna, Pitzer, and Scripps Colleges, Claremont, California 91711USA

Personalised recommendations