Checkerboard cut-up: Difference between revisions
Jump to navigation
Jump to search
Oscarlevin (talk | contribs) No edit summary |
Oscarlevin (talk | contribs) No edit summary |
||
| Line 1: | Line 1: | ||
[[File:Checkerboard_cut-up.png|right| | [[File:Checkerboard_cut-up.png|right|200px]] | ||
Here is my version of a nice induction problem. | Here is my version of a nice induction problem. | ||
Current revision as of 06:50, 9 July 2013
Here is my version of a nice induction problem.
Puzzle
You have a standard <m>8\times 8</m> checkerboard and a pair of scissors. If you only cut along the lines, you can create 21 L-shaped tiles (each made up of 3 checkerboard squares - no gluing allowed). However, doing so will leave one single square left over. Which of the original 64 squares could the extra, unused square be?
Extension
For which other sizes of checkerboard will this puzzle work, and which of those will the puzzle work the same way?