Jump to content

Conway puzzle

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by AMbot (talk | contribs) at 23:26, 26 July 2007 (clean up and re-categorisation per CFD July 21 , removed Category:Humanoid animals, replaced: Category:Articles with ASCII art → Cat). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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.

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

References

  1. ^ "Conway Puzzle". Wolfram MathWorld. Retrieved 2007-03-14.