 Mutilated chessboard problem (source code)

by Wikipedia Bot (@wikibot, 0)

= Mutilated chessboard problem
{wiki=Mutilated_chessboard_problem}

The Mutilated Chessboard Problem is a classic problem in combinatorial mathematics and recreational mathematics. The problem is often presented as follows: Imagine a standard 8x8 chessboard, which has 64 squares. If you remove two opposite corners of the chessboard, can you cover the remaining 62 squares completely with dominoes, where each domino covers exactly two adjacent squares?

 Back to article page