- #1
Mr Davis 97
- 1,462
- 44
Homework Statement
Delete one of the corner squares of a chessboard. Is it possible to cover the remaining area by ##21## dominoes of size ##1 \times 3##?
Homework Equations
The Attempt at a Solution
I claim that it is impossible. Here is my attempt to describe my solution in words. Go to the top left corner of the chessboard, and color it red. Move right, and color the square orange. Move right and color the square yellow. Move to the right and color the square red. Continue this pattern, moving right, and when reaching the end, starting from the very left of the next eight squares. In the end, there will be 22 red squares, 21 orange squares, and 21 yellow squares. Note that in this arrangement the top left square is red, the top right is orange, the bottom left is yellow and the bottom right is red. Now, WLOG delete the top right orange square, then the chessboard could not be tiled, since we must have an equal number of of red, orange, and yellow squares since each domino covers precisely one red, one orange, and one yellow square. If the orange square is deleted, we will have 22 red squares, 20 orange squares, and 21 yellow squares.
This proves that board cannot be tiled, since deleting anyone corner is the same as deleting any other corner, because of symmetry.
Last edited: