Coloring Arguments is the habit of coloring objects or positions to reveal parity, invariance, or impossibility. In contest math, that habit turns a crowded setup into a relation the student can test, bound, count, or compute. MathGrit teaches it as a recognizable signal, a deliberate move, and a final translation back to the original question.
$$\text{Color the cells/objects so each allowed piece covers a fixed color balance; a mismatch in totals proves impossibility.}$$
Assign colors to positions so that every allowed move or tile covers a predictable mix of colors; if the target needs a color balance no arrangement can supply, the task is impossible.
Why It Works
1
Color the board (or objects) with a pattern chosen so each allowed piece always covers the same multiset of colors — for dominoes, a checkerboard makes each domino cover one of each color.
2
Count how many of each color a valid tiling would have to cover, in total.
3
Compute the color counts actually available in the region.
4
If the required and available counts disagree, no tiling exists; the coloring exposes a parity/invariant obstruction the raw shape hides.
Worked Examples
Example 1
Two opposite corners are removed from an $8 \times 8$ chessboard, leaving $62$ squares. Can the board be tiled by $31$ dominoes, each covering two adjacent squares?
1
Color the board as a standard checkerboard: $32$ black and $32$ white squares, with adjacent squares always opposite colors.
2
Every domino covers two adjacent squares, hence exactly one black and one white square.
3
The two opposite corners share the same color (both black, say), so removing them leaves $30$ black and $32$ white squares.
4
A valid tiling of $31$ dominoes would need $31$ black and $31$ white squares; $30 \ne 31$, so it is impossible.
Answer:
No — the coloring forces an unequal black/white count, so no tiling exists.
Contest level
Can a $6 \times 6$ board be tiled by nine $1 \times 4$ tiles (each tile straight, horizontal or vertical)?
1
Color cell $(r, c)$ with color $(r + c) \bmod 4$, using four colors $0, 1, 2, 3$. Any $1 \times 4$ tile — horizontal or vertical — covers four consecutive values of $r + c$, hence exactly one cell of each color.
2
So a valid tiling by nine tiles would cover exactly $9$ cells of each color.
3
Count the colors actually present. Among rows $1\!-\!6$ the residues mod $4$ occur with multiplicities $[\,0\!:\!1,\ 1\!:\!2,\ 2\!:\!2,\ 3\!:\!1\,]$, and likewise for columns; combining gives color totals $9, 8, 9, 10$.
4
A tiling needs $9$ of every color, but color $3$ appears $10$ times and color $1$ only $8$ times — impossible.
Answer:
No — the $4$-coloring count is unequal, so no such tiling exists.
Olympiad / Challenge
Can a $10 \times 10$ board be tiled by $25$ T-tetrominoes (each tile a T-shaped group of four cells)?
1
Color the board as a standard checkerboard, giving $50$ black and $50$ white squares.
2
Place any single T-tetromino: it covers either $3$ black and $1$ white, or $1$ black and $3$ white. Either way it covers an odd number ($1$ or $3$) of black squares.
3
A tiling uses $25$ tiles, so the total number of black squares covered is a sum of $25$ odd numbers, which is odd.
4
But the board has exactly $50$ black squares, an even number. Odd $\ne$ even, so no tiling is possible.
Answer:
No — a sum of $25$ odd counts is odd, but the board has an even number ($50$) of black squares.
Going Deeper
The right coloring turns 'shape' into 'arithmetic': checkerboard captures parity, a $4$-coloring captures $1\times 4$ tiles, diagonal stripes capture L-trominoes — choose the coloring so each allowed piece covers a fixed, predictable color count.
Coloring/invariant arguments are the standard tool for tiling and chip-firing impossibility on olympiads and the harder AMC/AIME combinatorics problems, where they prove 'no configuration can work' without checking cases.
Pitfall: a coloring can only prove impossibility, never possibility. If the color counts happen to match, a tiling might still fail to exist for other reasons — you must exhibit an actual tiling to prove it can be done.
Spot the Signal
Look for problems where the key step is coloring objects or positions to reveal parity, invariance, or impossibility.
You can describe the hard part as coloring objects or positions to reveal parity, invariance, or impossibility, but a direct attack starts producing clutter.
The problem rewards preserving structure instead of expanding, listing, or guessing too early.
Learn the Move
Start by identify the problem-solving bottleneck that calls for coloring arguments, then rewrite the givens around it.
Name the relation that makes Coloring Arguments legal before doing computation.
Use the new relation to replace the messiest part of the problem with a cleaner one.
Translate the result back to the quantity the problem actually asks for.
Avoid These Traps
Do not use Coloring Arguments just because the surface looks familiar; verify the required condition first.
Applying Coloring Arguments because it sounds relevant, without checking the trigger first.
Stopping after spotting the technique instead of finishing the calculation or proof.
MathGrit Coach Note
Let coloring arguments reveal the strategic structure; then compute only what remains.
Try it on:
Practice a contest problem where the key step is coloring objects or positions to reveal parity, invariance, or impossibility.