Winning Strategies for the Game of Chomp: A Practical Approach

다국어 초록 (Multilingual Abstract)

The rule of the game of Chomp is simple and the existence of a winning strategy can easily be proved. However, the existence tells us nothing about what strategies are winning in reality.
Like in Chess or Baduk, many researchers studied the winning moves using computer programs, but no general patterns for the winning actions have not been found. In the paper, we aim to construct practical winning strategies based on backward induction. To do this we develop how to analyze Chomp and prove and find the winning strategies of the simple games of Chomp.

참고문헌 (Reference)

1 "http://www.math.ucla.edu/~tom/Games/chomp.html"

2 U. SCHWALBE, "Zermelo and the Early History of Game Theory" 34 : 123-137, 2001

3 E. ZERMELO, "Uber eine Anwendung der Mengenlehre auf die Theorie des Schachspiels" 501-504, 1913

4 D. ZEILBERGER, "Three-Rowed CHOMP" 26 : 168-179, 2001

5 F. SCHUH, "Spel van delers" 39 : 299-304, 1952

6 M. GARDNER, "Sim, Chomp and Race Track: new games for the intellect (and not for Lady Luck)" 228 (228): 108-115, 1973

7 A. BROUWER, "On Three-Rowed Chomp" 5 (5): 1-14, 2005

8 E. FRIEDMAN, "Nonlinear dynamics in combinatorial games: Renormalizing Chomp" 17 : 023117-, 2007

9 S. BADILLO-RIOS, "Mathematical and Computational Analysis of Chomp, mimeo"

10 X. SUN, "Improvements on Chomp" 2 (2): 8-, 2002

11 M. GARDNER, "A new miscellany of problems, and encores for Race Track, Sim, Chomp and elevators" 228 (228): 102-107, 1973

12 D. GALE, "A Curious Nim-Type Game" 81 : 876-879, 1974