Conway puzzle: Difference between revisions
Content deleted Content added
+ref |
Ext.links |
||
| Line 8: | Line 8: | ||
==See also== |
==See also== |
||
*[[Slothouber–Graatsma puzzle]] |
*[[Slothouber–Graatsma puzzle]] |
||
==External links== |
|||
*[http://www.johnrausch.com/PuzzlingWorld/chap03f.htm The Conway puzzle in Stewart Coffin's "The Puzzling World of Polyhedral Dissections"] |
|||
==References== |
==References== |
||
Revision as of 03:32, 5 January 2009
Conway's puzzle is a packing problem using rectangular blocks, named after its inventor, mathematician John Conway. It calls for packing thirteen 1 × 2 × 4 blocks, one 2 × 2 × 2 block, one 1 × 2 × 2 block, and three 1 × 1 × 3 blocks into a 5 × 5 × 5 box.[1]
Solution
The solution of the Conway puzzle is straightforward when one realizes that the three 1 × 1 × 3 blocks need to be placed so that precisely one of them appears in each 5 × 5 × 1 slice of the cube.[2]
See also
External links
References
- ^ "Conway Puzzle". Wolfram MathWorld. Retrieved 2007-03-14.
- ^ Elwyn R. Berlekamp, John H. Conway and Richard K. Guy: Wining ways for your mathematical plays, 2nd ed, vol. 4, 2004.
 | This applied mathematics–related article is a stub. You can help Wikipedia by expanding it. |