MathDB
Cono Sur Olympiad 2012

Source: Problem 5

November 3, 2012
rotationcombinatorics proposedcombinatorics

Problem Statement

5. AA and BB play alternating turns on a 2012×20132012 \times 2013 board with enough pieces of the following types:
Type 11: Piece like Type 22 but with one square at the right of the bottom square. Type 22: Piece of 22 consecutive squares, one over another. Type 33: Piece of 11 square.
At his turn, AA must put a piece of the type 11 on available squares of the board. BB, at his turn, must put exactly one piece of each type on available squares of the board. The player that cannot do more movements loses. If AA starts playing, decide who has a winning strategy.
Note: The pieces can be rotated but cannot overlap; they cannot be out of the board. The pieces of the types 11, 22 and 33 can be put on exactly 33, 22 and 11 squares of the board respectively.