Chessboard Tiling explores tiling a chessboard with dominoes.
We could try tiling a chessboard with triominoes...
Each tile covers 3 squares, and a chessboard has 64 squares, so there will be at least one square left uncovered because 64 is one more than a multiple of three.
Is it possible to tile every square except one?
If so, which square(s) can be left uncovered?
You may like to explore tiling enlargements of an L-Triomino next.