Problem #WSP-5565

Problems Invariants

Problem

You have an \(n\times m\) chocolate bar. You break the bar into two pieces along a line between its squares, then your friend and you take turns (your friend starts) choosing one of the pieces and breaking it again along a line between its squares. The player who cannot make a move loses. For which values of \(n\) and \(m\) do you win?