Slothouber–Graatsma puzzle
packing problem that calls for packing six 1×2×2 blocks and three 1×1×1 blocks into a 3×3×3 box
Press Enter · cited answer in seconds
0 sources
Slothouber–Graatsma puzzle
Summary
Slothouber–Graatsma puzzle is a packing problem[1]. It draws 16 Wikipedia views per month (packing_problem category, ranking #3 of 3).[2]
Key Facts
- Slothouber–Graatsma puzzle is credited with the discovery of Jan Slothouber[3].
- Slothouber–Graatsma puzzle is credited with the discovery of William Graatsma[4].
- Slothouber–Graatsma puzzle's image is recorded as Con11.jpg[5].
- Slothouber–Graatsma puzzle's instance of is recorded as packing problem[6].
- Jan Slothouber is named after Slothouber–Graatsma puzzle[7].
- William Graatsma is named after Slothouber–Graatsma puzzle[8].
- Slothouber–Graatsma puzzle's subclass of is recorded as puzzle[9].
- Slothouber–Graatsma puzzle's Commons category is recorded as Slothouber-Graatsma puzzle[10].
- Slothouber–Graatsma puzzle's Freebase ID is recorded as /m/0f2fmg[11].
- Slothouber–Graatsma puzzle's schematic is recorded as Slothouber Graatsma puzzle.svg[12].
- Slothouber–Graatsma puzzle's Microsoft Academic ID is recorded as 62457341[13].
Body
Works and Contributions
Credited discoveries include Jan Slothouber[3], an architect[14], 1918–2007[15], of Kingdom of the Netherlands[16], awarded the Sikkens Prize[17], specialised in product design[18] and William Graatsma[4], an architect[19], 1925–2017[20], of Kingdom of the Netherlands[21], awarded the Sikkens Prize[22], specialised in product design[23].
Why It Matters
Slothouber–Graatsma puzzle draws 16 Wikipedia views per month (packing_problem category, ranking #3 of 3).[2] It has Wikipedia articles in 6 language editions, a strong signal of global cultural recognition.[24]