Skip to main content
OlympiadHQ

Browse · MathNet

Print

Singapore Mathematical Olympiad (SMO)

Singapore counting and probability

Problem

Define a domino to be a rectangular block. A square grid is filled with non-overlapping dominoes, leaving a single gap. John then repeatedly slides dominoes into the gap; each domino is moved at most once. What is the maximum number of times that John could have moved a domino? (Example: In the grid shown below, John could move 2 dominoes: D, followed by A.)
ABC
D


problem
Solution
Label the squares in the grid to . Consider the position of the gap after a domino is moved. Note that the parity of the coordinates of the square containing the gap will not change. Also, the same square cannot contain the gap twice, otherwise this implies that a domino was moved into that square, and was moved out of the square again later, which is disallowed.

Considering coordinates modulo , in the grid, there are squares labelled , squares labelled or , and squares labelled . Hence, the number of moves is at most , if all the squares are the 'gap square' at some point.

This is attainable by connecting these squares in a 'snake' pattern, and sliding dominoes accordingly; the remaining rectangles can be also tiled with dominoes that do not move throughout.

Final answer
1024143

Techniques

Invariants / monovariantsColoring schemes, extremal arguments