Scaling, renormalization, and universality in combinatorial games games: the geometry of chomp

Authors:
Eric J. Friedman;Adam Scott Landsberg
Affiliations:
School of ORIE, Cornell University, Ithaca, NY;Joint Science Department, Claremont McKenna, Pitzer, and Scripps Colleges, Claremont, Californi
Venue:
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
Year:
2007

Citing 5
Cited 0

One jump ahead: challenging human supremacy in checkers

One jump ahead: challenging human supremacy in checkers
Regular Article: Three-Rowed CHOMP

Advances in Applied Mathematics
Kasparov Vs. Deep Blue: Computer Chess Comes of Age

Kasparov Vs. Deep Blue: Computer Chess Comes of Age
Complexity, appeal and challenges of combinatorial games

Theoretical Computer Science - Algorithmic combinatorial game theory
Appendix B: open problems at the 2002 Dagstuhl seminar on algorithmic combinatorial game theory

Theoretical Computer Science - Algorithmic combinatorial game theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.