Conway puzzle: Difference between revisions
Content deleted Content added
→Solution: a proper image by myself |
|||
| Line 4: | Line 4: | ||
The solution of the Conway puzzle is straightforward when one realizes that the three 1 × 1 × 3 blocks need to be placed so that at least one of them appears in each 5 × 5 × 1 slice of the cube. |
The solution of the Conway puzzle is straightforward when one realizes that the three 1 × 1 × 3 blocks need to be placed so that at least one of them appears in each 5 × 5 × 1 slice of the cube. |
||
[[Image:Conway puzzle partial solution.png|thumb|A possible placement for the three 1×1×3 blocks.]] |
|||
The letters a, b, and c represent 1 × 1 × 3 blocks, and everything else is represented by an *. |
|||
''Slice #'' |
|||
'' 1 2 3 4 5'' |
|||
''aaa** ***** ***** ***** *****'' |
|||
''***** ***b* ***b* ***b* *****'' |
|||
''***** ***** ***** ***** ****c'' |
|||
''***** ***** ***** ***** ****c '' |
|||
''***** ***** ***** ***** ****c '' |
|||
==See also== |
==See also== |
||
Revision as of 01:03, 1 August 2007
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 at least one of them appears in each 5 × 5 × 1 slice of the cube.
See also
References
- ^ "Conway Puzzle". Wolfram MathWorld. Retrieved 2007-03-14.
 | This applied mathematics–related article is a stub. You can help Wikipedia by expanding it. |