Jump to content

Conway puzzle

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Addbot (talk | contribs) at 09:53, 2 March 2013 (Bot: Migrating 3 interwiki links, now provided by Wikidata on d:q1130010). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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 vertical block has corners touching corners of the two horizontal 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. ^ Weisstein, Eric W. "Conway Puzzle". MathWorld.
  2. ^ Elwyn R. Berlekamp, John H. Conway and Richard K. Guy: winning ways for your mathematical plays, 2nd ed, vol. 4, 2004.