Checkerboard and dominoes: Difference between revisions

From Math Puzzle Wiki
Jump to navigation Jump to search
Oscarlevin (talk | contribs)
Oscarlevin (talk | contribs)
No edit summary
 
Line 1: Line 1:
[[File:Checkerboard_dominoes.png|right|150px]]
This is a rather well known puzzle, but for good reason.
==Puzzle==
==Puzzle==



Current revision as of 17:08, 14 July 2013

This is a rather well known puzzle, but for good reason.

Puzzle

A regular checker board has 64 squares (arranged in an 8 by 8 square). You happen to have a set of dominoes, each of which can cover exactly 2 squares on the checker board. Suppose you cut out one square from opposite corners. Is it possible to cover this mutilated board with non-overlapping dominoes? That is, is there a way to pair up the remaining 62 squares so that the two squares in each pair are adjacent? Prove your answer.

Help

Hint
Answer
Solution

See also

Checkerboard cut-up

Longest road