In one sentence
However you place a 1×2 domino, across or down, the two cells it covers are always neighbors. Color the board as a checkerboard, and neighboring cells always have different colors. So:
Endlessly many tilings, all governed by one sentence. That is what coloring (or giving each cell a number, called assigning values) does: find a marking on which every move has a fixed effect. Then a little counting tells you which things can never be done.
Predict first
Cut the top-left and bottom-right corners out of an 8×8 board, leaving cells. Can dominoes of size 1×2 cover it exactly?
No. The number of cells matches, but the colors do not. Look at it step by step below.
Example: a board missing two corners
Step 1 / 5- Count the cells
With two opposite corners cut out, cells are left. , so the cell count shows no problem.
Notice the power of this proof: we did not try every tiling (there are far too many to count); we counted colors once.
Stop 1 · Coloring (Vol. 7)
A different tile needs a different coloring. A 1×3 strip covers three cells in a row, and the checkerboard cannot control it. Use three colors on the diagonals instead: the color of the cell in row , column is decided by the remainder of on division by . The three cells of a strip have three consecutive values of , so their remainders are exactly , once each.
Example: an 8×8 board with one corner cut out. Can 1×3 strips cover it?
Step 1 / 4- Count the cells
cells are left, and . The cell count is fine. Tap some cells and try laying a few strips first.
Think about it: for cells of each color to be left, which color must the cell you cut out be? (And if you cut out the right color, can it always be covered? See the Mistake Museum at the bottom of the page.)
Stop 2 · Operations and games (Vol. 7)
Instead of painting colors, write down a number: that is assigning values. A good assignment keeps a “total” unchanged by every move.
A row of cells is numbered to from left to right, with one piece in each cell. In each move, you choose two pieces, move one of them one cell to the left and the other one cell to the right. Can you get all pieces into the same cell?
Example: can six pieces meet in one cell?
Step 1 / 4- Give each piece a value
Let the “value” of each piece be the number of the cell it is in. Add up the values of all the pieces and call the total .
Predict first
Change the problem to cells and pieces. The invariant is , and . What does this tell you?
An invariant can only say “no”. Here it does not object, so it is our turn to act: pieces and walk three steps toward each other, pieces and two steps each, pieces and one step each, and all of them reach cell . “Possible” needs a construction; only “impossible” comes from an invariant.
Stop 3 · Parity arguments (Vol. 6)
A checkerboard coloring is really a picture of parity: color the cell black when is even and white when it is odd.
A classroom has seats, all taken. The teacher asks everyone to move to a seat directly in front of, behind, left of or right of their own. Can it be done?
Example: 25 people all move to a neighboring seat
Step 1 / 4- The seating plan
Each cell is a seat. For neighboring seats, “row number + column number” differs by exactly , so the parities are opposite.
What if the classroom is ? There are black and white seats, so parity no longer objects, and it really can be done: in each row, neighbors swap seats (columns 1 and 2 swap, columns 3 and 4 swap), and in the last column the people swap in pairs, front and back.
Practice
Cut the top-left and bottom-right corners out of a 6×6 board. What is the largest number of non-overlapping 1×2 dominoes you can place on the remaining cells?
A row of cells is numbered to , with one piece in each cell. Each move picks two pieces and moves one of them one cell left and the other one cell right. For all the pieces to meet in one cell, the invariant “sum of cell numbers” must be a multiple of . For how many among does this check pass?
Cut one cell out of a 7×7 board, leaving cells, to be covered by strips of size 1×3. Color the board with three colors according to “the remainder of row number + column number on division by ” (the top-left cell has row number and column number ). Only cutting out a cell of one particular color gives any hope. How many cells of that color are there?