Guichard-Combinatorics-Graph-Theory · Problem 1.1.5

Fundamentals

Mathematics — Probability · domino-tiling

Problem

Suppose the square in row 3, column 3 of an 8×88 \times 8 board is removed. Can the remainder be covered by 1×31 \times 3 tiles? Show a tiling or prove that it cannot be done.

Browse the problem library