kids encyclopedia robot

Hoffman's packing puzzle facts for kids

Kids Encyclopedia Facts
Hoffman packing puzzle
A solution to Hoffman's packing puzzle with 4×5×6 cuboids (1), exploded to show each layer (2). In the SVG file, hover over the cuboids for their dimensions.
HoffmansPackingPuzzle
Hoffman's packing puzzle, disassembled

Hoffman's packing puzzle is an assembly puzzle named after Dean G. Hoffman, who described it in 1978. The puzzle consists of 27 identical rectangular cuboids, each of whose edges have three different lengths. Its goal is to assemble them all to fit within a cube whose edge length is the sum of the three lengths. writes that the first person to solve the puzzle was David A. Klarner, and that typical solution times can range from 20 minutes to multiple hours.

Construction

The puzzle itself consists only of 27 identical rectangular cuboid-shaped blocks, although physical realizations of the puzzle also typically supply a cubical box to fit the blocks into. If the three lengths of the block edges are x, y, and z, then the cube should have edge length x + y + z. Although the puzzle can be constructed with any three different edge lengths, it is most difficult when the three edge lengths of the blocks are close enough together that x + y + z < 4 min(x,y,z), as this prevents alternative solutions in which four blocks of the minimum width are packed next to each other. Additionally, having the three lengths form an arithmetic progression can make it more confusing, because in this case placing three blocks of the middle width next to each other produces a row of the correct total width but one that cannot lead to a valid solution to the whole puzzle.

Higher dimensions

AM-GM inequality
Solution to the 2d puzzle

A two-dimensional analogue of the puzzle asks to pack four identical rectangles of side lengths x and y into a square of side length x + y; as the figure shows, this is always possible. In d dimensions the puzzle asks to pack dd identical blocks into a hypercube. By a result of Raphael M. Robinson this is again solvable whenever d = d1 × d2 for two numbers d1 and d2 such that the d1- and d2-dimensional cases are themselves solvable. For instance, according to this result, it is solvable for dimensions 4, 6, 8, 9, and other 3-smooth numbers. In all dimensions, the inequality of arithmetic and geometric means shows that the volume of the pieces is less than the volume of the hypercube into which they should be packed. However, it is unknown whether the puzzle can be solved in five dimensions, or in higher prime number dimensions.

kids search engine
Hoffman's packing puzzle Facts for Kids. Kiddle Encyclopedia.