• Journal for History of Mathematics
• /
• v.31 no.3
• /
• pp.151-166
• /
• 2018

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.