Problem #PRU-35430

Problems Set theory and logic Theory of algotithms Game theory Game theory (other) Algebra and arithmetic Number theory. Divisibility Odd and even numbers

12–13 3.0

Problem

Given a board (divided into squares) of the size: a) $10 \times 12$ , b) $9 \times 10$ , c) $9 \times 11$ , consider the game with two players where: in one turn a player is allowed to cross out any row or any column if there is at least one square not crossed out. The loser is the one who cannot make a move. Is there a winning strategy for one of the players?

To see the solution register and get verified.