🔴 Riddle #233 of 240
Two squares of opposite colours are removed from a chessboard (one black square and one white square, anywhere). Can the remaining 62 squares always be tiled exactly by 31 dominoes? (Compare the classic puzzle where the two removed corners have the SAME colour and tiling is impossible.)
Think about it first. When you're ready:
Yes, always (Gomory's theorem)
A closed tour through all 64 squares alternates colours, so the two removed squares sit an odd distance apart and split it into two even-length arcs, each tileable by dominoes.