Question 37
Nimatha and Thanima play a game on an $8 \times 8$ chessboard. Taking turns, starting with Nimatha, each player chooses a square that has not yet been chosen and colours it in their colour (red for Nimatha, blue for Thanima). Show that Thanima can always ensure that Nimatha cannot colour any $2 \times 2$ square entirely in red.