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 Dean G. Hoffman, 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]
^Cite error: The named reference rausch was invoked but never defined (see the help page).
^ abCite error: The named reference hoffman was invoked but never defined (see the help page).
^Cite error: The named reference space was invoked but never defined (see the help page).
