Gomory's Theorem

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/