Jump to content

Conway puzzle: Difference between revisions

From Wikipedia, the free encyclopedia
Content deleted Content added
Hyacinth (talk | contribs)
{{Packing problem}}
Hyacinth (talk | contribs)
Line 19: Line 19:


[[Category:Discrete geometry]]
[[Category:Discrete geometry]]
[[Category:Tiling puzzles]]
[[Category:Packing problem]]
[[Category:Recreational mathematics]]
[[Category:Recreational mathematics]]
[[Category:Tiling puzzles]]


{{Mathapplied-stub}}
{{Mathapplied-stub}}

Revision as of 23:21, 24 September 2012

Pieces used in the Conway puzzle, one of each kind.

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

A possible placement for the three 1×1×3 blocks.

The solution of the Conway puzzle is straightforward when one realizes, based on parity considerations, 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] This is analogous to similar insight that facilitates the solution of the simpler Slothouber–Graatsma puzzle.

See also

References

  1. ^ "Conway Puzzle". Wolfram MathWorld. Retrieved 2007-03-14.
  2. ^ Elwyn R. Berlekamp, John H. Conway and Richard K. Guy: winning ways for your mathematical plays, 2nd ed, vol. 4, 2004.