Difference between revisions of "Checkerboard and dominoes"
From Math Puzzle Wiki
Oscarlevin (talk | contribs) m (Reverted edits by Ocafaromy (talk) to last revision by Oscarlevin) |
|||
Line 1: | Line 1: | ||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
==Puzzle== | ==Puzzle== | ||
Revision as of 06:46, 24 November 2010
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.