Hoffman's packing puzzle

A solution to Hoffman's packing puzzle with 4×5×6 cuboids coloured by orientation (1), and exploded to show each layer (2). In the SVG file, hover over the cuboids for their dimensions.

Hoffman's packing puzzle, disassembled

Hoffman's packing puzzle is an assembly puzzle named after , who described it in 1978.^[1] 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.^[2]^[3]

Hoffman (1981) 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.^[2]

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.^[2]

Mathematical analysis[]

Each valid solution to the puzzle arranges the blocks in an approximate $3 \times 3 \times 3$ grid of blocks, with the sides of the blocks all parallel to the sides of the outer cube, and with one block of each width along each axis-parallel line of three blocks. Counting reflections and rotations as being the same solution as each other, the puzzle has 21 combinatorially distinct solutions.^[2]^[4]

The total volume of the pieces, $27 xyz$ , is less than the volume $(x + y + z) 3$ of the cube that they pack into. If one takes the cube root of both volumes, and divides by three, then the number obtained in this way from the total volume of the pieces is the geometric mean of $x$ , $y$ , and $z$ , while the number obtained in the same way from the volume of the cube is their arithmetic mean. The fact that the pieces have less total volume than the cube follows from the inequality of arithmetic and geometric means.^[2]^[3]

Higher dimensions[]

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 $d d$ identical blocks into a hypercube. By a result of Raphael M. Robinson this is again solvable whenever $d = d 1 \times d 2$ for two numbers $d 1$ and $d 2$ such that the $d 1$ - and $d 2$ -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.^[2]^[5]

References[]

^ Rausch, John, "Put-Together – Hoffman's Packing Puzzle", Puzzle World, archived from the original on 2019-11-17, retrieved 2019-11-16
^ ^a ^b ^c ^d ^e ^f Hoffman, D. G. (1981), "Packing problems and inequalities", in Klarner, David A. (ed.), The Mathematical Gardner, Springer, pp. 212–225, doi:10.1007/978-1-4684-6686-7_19
^ ^a ^b Alsina, Claudi; Nelsen, Roger B. (2015), "Problem 3.10", A Mathematical Space Odyssey: Solid Geometry in the 21st Century, Dolciani Mathematical Expositions, 50, Mathematical Association of America, p. 63, ISBN 9780883853580
^ Berlekamp, Elwyn R.; Conway, John H.; Guy, Richard K. (2004), Winning Ways for Your Mathematical Plays, IV, A K Peters, pp. 913–915
^ von Holck, Nikolaj Ingemann (January 2018), An Experimental Approach to Packing Problems (PDF), Bachelor's thesis, supervised by Søren Eilers, University of Copenhagen, archived (PDF) from the original on 2019-11-17, retrieved 2019-11-17

[rausch-1] Rausch, John, "Put-Together – Hoffman's Packing Puzzle", Puzzle World, archived from the original on 2019-11-17, retrieved 2019-11-16

[hoffman-2] ^ ^a ^b ^c ^d ^e ^f Hoffman, D. G. (1981), "Packing problems and inequalities", in Klarner, David A. (ed.), The Mathematical Gardner, Springer, pp. 212–225, doi:10.1007/978-1-4684-6686-7_19

[space-3] Alsina, Claudi; Nelsen, Roger B. (2015), "Problem 3.10", A Mathematical Space Odyssey: Solid Geometry in the 21st Century, Dolciani Mathematical Expositions, 50, Mathematical Association of America, p. 63, ISBN 9780883853580

[ww-4] Berlekamp, Elwyn R.; Conway, John H.; Guy, Richard K. (2004), Winning Ways for Your Mathematical Plays, IV, A K Peters, pp. 913–915

[xa-5] von Holck, Nikolaj Ingemann (January 2018), An Experimental Approach to Packing Problems (PDF), Bachelor's thesis, supervised by Søren Eilers, University of Copenhagen, archived (PDF) from the original on 2019-11-17, retrieved 2019-11-17

[1]

[2]

[3]

[4]

[5]