Problem #PRU-100348

Problems Discrete Mathematics Algorithm Theory Game theory Game theory (other) Winning and loosing positions

Problem

There is a chequered board of dimension \(10 \times 12\). In one go you are allowed to cross out any row or column if it contains at least one square which was not crossed out yet. The loser is the player who cannot make a move. Is there a winning strategy for any player?