An n by n board loses one corner square. For which n can the rest be tiled by 1 by 2 dominoes?
Quant ResearchLevel: IntermediateDomino tiling invariant
An n by n board loses one corner square. For which n can the rest be tiled by 1 by 2 dominoes?
Hints
- Check total area parity first.
- For sufficiency remove one row and tile the even-height rectangle.
Answer
Exactly odd n. If n is even, n^2-1 is odd, impossible. For odd n, tile the n-1 remaining cells of the top row horizontally, then tile the remaining n-1 rows vertically in pairs. The n=1 empty board is trivial.
Source and licence: Oscar Levin — Discrete Mathematics: An Open Introduction, 3rd edition · CC-BY-SA-4.0 · answer: Quantoros editorial