# Chomp again

**Discrete Mathematics**Level 5

Knowing that the game on rectangular boards is rigged, the players are now playing with irregular boards as depicted on the picture. With optimal play, who wins each game? Answer \(1\) if the first player wins and \(2\) if the second player wins. String all five digits together. Thus, if the first player wins on all boards but the M, your answer should be \(11121\).

Remember that each player must select a piece; they cannot select an empty square! So on the P, it's illegal to move on \((1,1)\) to capture the three pieces to the right and below it, as \((1,1)\) is not a piece.

**Your answer seems reasonable.**Find out if you're right!

**That seems reasonable.**Find out if you're right!

Already have an account? Log in here.