Suppose a standard chessboard has two diagonally opposite corners removed, leaving squares. Is it possible to place dominoes of size so as to cover all of these squares?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
The squares we remove in opposite corners have the same color; let's say they are both black. Then there are only 30 black squares left, meaning that we can place at most 30 dominoes, since every domino will cover a white as well as a black square.