MathDB
Winning Strategy For The Game - [Bulgaria NMO 2010]

Source:

December 25, 2010
geometryrectanglecombinatorics unsolvedcombinatorics

Problem Statement

A table 2×20102 \times 2010 is divided to unit cells. Ivan and Peter are playing the following game. Ivan starts, and puts horizontal 2×12 \times 1 domino that covers exactly two unit table cells. Then Peter puts vertical 1×21 \times 2 domino that covers exactly two unit table cells. Then Ivan puts horizontal domino. Then Peter puts vertical domino, etc. The person who cannot put his domino will lose the game. Find who have winning strategy.