Gomory's theorem, in combinatorics, states that if one black square and one white square are removed from a standard 8 by 8 chessboard, the remaining 62 squares can always be tiled by 31 dominoes. The result generalizes the mutilated chessboard problem, in which two same-colored corner squares are removed and no tiling is possible because a domino always covers one square of each color, so the count of remaining squares of each color must be equal for a tiling to exist. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/
Facts
Classification
Statement Form Connections
Has Statement Form
Entity-backed identity for the statement-form enum value this theorem already carries, resolved to a mathematics concept by an explicit value-to-entity map (phase 3 bucket conversion, docs\design_entity_backed_browse_buckets_20260928.md). The statement-form fact itself stays on the theorem unchanged.
Sources
1. Mutilated chessboard problem (Wikipedia)
Solution sectionQuote, Solution section
If two squares of opposite colors are removed, then the remaining board can always be tiled with dominoes
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.