Chomp

The 2D version of Chomp is a two-player game played on a board that consists of the divisors of a chosen integer. Each player takes turns choosing a divisor on the board.  The multiples of the divisor are the pieces below and to the right of it and those pieces disappear after every turn. The objective of the game is to avoid taking the upper left piece and the last player to do so, loses the game. Previous research has shown that the game has a winning strategy for player one, but the actual winning strategy has not been found. The objective of this research project is to find the optimal winning strategy of the game for all board sizes. In order to find this strategy, a computer program using adaptive learning was developed in this project.  A simulation of the game was created, but it was modified to the computer vs. computer program.  The program allows the user to easily modify the size of the board and the amount of games to play. The program will be allowed to run for a fixed amount of games keeping the size of the board constant. The program will provide data regarding the winner of the game and the winning moves. Upon having the data, one can find a pattern leading to the winning strategy and use it to find or make predictions regarding the 3D version of Chomp. This is an ongoing research project and further findings will be discussed.