This group gathers theorems about covering a board or a region exactly with tiles, and about the existence and counting of such tilings. It covers domino tilings of a chessboard, including the mutilated chessboard problem posed by Max Black in 1946 and the result that, after any two squares are removed, the rest can be tiled by dominoes if and only if the removed squares are of different colors, and it extends to the tilings of larger regions such as the Aztec diamond. Tilings of the plane by shapes studied as geometry belong with Geometry instead.
All Tilings and Board Coverings
Filter Results1 entry
Sources
Mutilated chessboard problem (Wikipedia)
Has Member: Gomory's Theorem, LeadQuote, Has Member: Gomory's Theorem, Lead
if any two squares are removed from the chessboard, the rest can be tiled by dominoes if and only if the removed squares are of different colors
View the Source 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.