Chomp is a game where two players attempt to eat peices of a chocolate bar without being the one to eat the "poison square". The rules are as follows: We start with a rectangular grid, and players alternate turns. On each turn, a player chooses on tile on the grid and removes all tiles that are at least as high and at least as far right as it. You can only choose tiles that haven't been removed yet. The player that has to pick the last tile (the bottom-left tile) loses.

An example game is here:

Player 1 removes chooses (5,3) on the first turn. Then Player 2 chooses (2,4), Player 1 chooses (2,1), and Player 2 chooses (1,2), winning the game.

I found a place where I can play a game of 4x7 Chomp against a computer and input a starting sequence of moves so that I can effectively save a game. I will have Manifold play as Player 1 and the computer as Player 2. This means that Manifold can win if they play right, since Player 1 always has the winning strategy in Chomp (except on a 1x1 board).

The moves will be chosen as follows: I'll create free-response markets asking which tile Manifold should choose for the next move, and the top three options at close will be the contenders. I'll then create three conditional markets asking whether Manifold will win, given that each move is chosen, and choose the move with the highest average probability (i.e., the one that Manifold thinks is best). I'll then see how the computer responds to that move and continue until the game has ended.