Showing that a tiling of a chessboard is impossible

  • Thread starter Thread starter Mr Davis 97
  • Start date Start date
  • Tags Tags
    Impossible
Click For Summary

Homework Help Overview

The problem involves determining the possibility of covering a modified chessboard, from which one corner square has been removed, using 21 dominoes of size 1 x 3. The discussion centers on the implications of color patterns and the distribution of squares after the removal of a corner.

Discussion Character

  • Conceptual clarification, Assumption checking

Approaches and Questions Raised

  • The original poster describes a color-coding method to argue that removing a specific square leads to an unequal distribution of colored squares, suggesting that tiling is impossible. Some participants express agreement with this reasoning, while others raise questions about alternative configurations and their implications.

Discussion Status

Participants are exploring different scenarios regarding which square is removed and discussing the resulting configurations. There is a recognition of symmetry in the problem, but also an acknowledgment that having equal numbers of colored squares does not guarantee the ability to tile the board.

Contextual Notes

The discussion includes considerations about the implications of removing different corner squares and the resulting color distributions, as well as the assumptions made regarding symmetry and tiling possibilities.

Mr Davis 97
Messages
1,461
Reaction score
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:
Physics news on Phys.org
I agree. QED
 
.Scott said:
I agree. QED
I have one question. Say that instead of deleting the orange square I deleted the top left red square. Then we would have 21 red squares, 21 orange squares, and 21 yellow squares. I know that, by symmetry, I proved that this cannot be tiled, but is there a direct explanation in this case as to why this arrangement cannot be tiled? Of course we can't, but it "seems" like we should be able to, since we have 21 of each color.
 
Since removing a corner square can result in a 20-21-22 result, it is demonstrated that it is not possible.
Just because you get the 21-21-21 result with a different (rotated) configuration does not mean that it can be tiled. Nothing is excluded by the 21-21-21 result.
 
  • Like
Likes   Reactions: Mr Davis 97

Similar threads

  • · Replies 23 ·
Replies
23
Views
4K
Replies
1
Views
3K
Replies
7
Views
2K
  • · Replies 23 ·
Replies
23
Views
3K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 6 ·
Replies
6
Views
7K
  • · Replies 3 ·
Replies
3
Views
4K
  • · Replies 1 ·
Replies
1
Views
4K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 44 ·
2
Replies
44
Views
9K