CHOMP
Main Line Math Circle
January 21, 2026
Bill Hawkins
Welcome!
Thanks!!!
Schedule
Warm Up Problem
SOLUTION
The answer is 83. Here is a solution that involves working backward from the final result of 1.
For each stage, we have a collection of integers and we set these integers equal to to find the integer(s) at the previous stage.
SOLUTION
We can both check and visualize the solution using a tree diagram:
2xN Chomp
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Chomp is a strategic two-player game played on a rectangular grid resembling a chocolate bar.
2xN Chomp
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Players take turns selecting a square to “chomp” (eat).
When you chomp a square you remove that square and all squares positioned to the right and below it.
2xN Chomp
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Here’s the catch…the top left square is poisoned. The player compelled to eat this square loses.
2xN Chomp
Suppose Player 1 chomps the square in the (1,10) position.
Which squares are eliminated?
2xN Chomp
All squares to the right and below are removed.
Now, suppose player 2 chomps (2,5). What happens?
2xN Chomp
There is nothing below (2, 5) so all the squares to the right are removed.
Suppose Player 1 chomps (1,2)…good idea?
2xN Chomp
Bad idea…we wish to force the other player to eat the poison. By selecting (1,2), player 2 can eat square (2,1) forcing player 1 to eat the poison and lose.
2xN Chomp
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Does Player 1 or Player 2 have an advantage?
Describe a winning strategy for that player
Work Backwards
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| | | |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Work Backwards
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
?????????
A Strategy!
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
NxN Chomp
Does Player 1 or Player 2 have an advantage now?
Can you describe a general strategy for that player that will win every time?
NxN Chomp
Player 1 should NOT take only the square in the bottom right corner!
While this creates symmetry, it leaves open a counter-move for Player 2 that does the same.
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
NxN Chomp
Player 1 should take the square in the (2,2) position!
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
NxN Chomp
Player 1 should take the square in the (2,2) position!
This creates a situation where Player 2 must pick from a row or column and Player 1 can mirror their move.
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
MxN Chomp
Playing CHOMP on different size boards can be fun because the exact winning strategy for these boards isn’t easily known or easily discoverable.
However…we CAN prove the existence of such a strategy!!!!
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| | | | | | |
| | | | | | |
SURVEY!!