Remove two opposite corners of an n by n board, n=2. Can the rest ever be tiled with dominoes? Explain both parities…
Quant ResearchLevel: IntermediateTwo tiling obstructions
Remove two opposite corners of an n by n board, n>=2. Can the rest ever be tiled with dominoes? Explain both parities of n.
Hints
- Try the simpler area parity before coloring.
- For even n compare the two removed colors.
Answer
Never. For odd n, n^2-2 is odd, so area alone forbids tiling. For even n, opposite corners have the same chessboard color; removing them unbalances the two colors by two, but every domino covers one of each.
Source and licence: Oscar Levin — Discrete Mathematics: An Open Introduction, 3rd edition · CC-BY-SA-4.0 · answer: Quantoros editorial