A couple of friends of mine were discussing a problem concerning this shape:

enter image description here

Is it possible to assemble enough of these to form a cube?

I have discovered a lot of impossible positions but was not successful in creating something useful. We have managed to build a 12x12x4 tower with leftover blocks at the top, however.

Maybe someone here has any ideas on how to tackle this problem? My next steps would be to try and extend our 12x12x4 tower, and if that doesn't work, to write a program to search for solutions.

  • 14
    $\begingroup$ We can't see whether the rear bottom corner is a hole or a cubie. $\endgroup$
    – shoover
    Oct 22, 2023 at 18:11
  • 5
    $\begingroup$ This should have been a great question in Puzzling SE $\endgroup$
    – Shadow
    Oct 23, 2023 at 2:59
  • 3
    $\begingroup$ If you manage creating a block of size $a \cdot b \cdot c$, you can always turn this into a cube with size $(a \cdot b \cdot c) \cdot (a \cdot b \cdot c) \cdot (a \cdot b \cdot c)$. $\endgroup$
    – Dominique
    Oct 23, 2023 at 13:47
  • $\begingroup$ Side note: $8$ copies of the version with a hole at the back, as commented by @shoover, can be assembled into a $4 \times 4 \times 4$ cube. $\endgroup$
    – nickgard
    Oct 26, 2023 at 8:03

1 Answer 1


Assemble four copies of the shape as shown. Four copies of the assembly create a 6x6x4 cuboid, which can be used to create a 12x12x12 cube.

enter image description here

  • 2
    $\begingroup$ @Henry A brute force search finds no solution for $6\times6\times6$. Search on $9\times9\times9$ is currently running on my home PC while I'm at work. $\endgroup$ Oct 23, 2023 at 14:33
  • 1
    $\begingroup$ what software do you use to search for solutions? $\endgroup$
    – Burnsba
    Oct 23, 2023 at 17:37
  • 1
    $\begingroup$ @Burnsba Just some code I wrote. $\endgroup$ Oct 23, 2023 at 18:50
  • 2
    $\begingroup$ Search finished as expected: no solutions for $9\times9\times9$. There is no way to cover a $9\times9$ face while staying within the bounds of the cube. $\endgroup$ Oct 23, 2023 at 22:20
  • 3
    $\begingroup$ @Burnsba I note that this is a classic example of an exact cover problem and there are many programs already written for such problems, a famous one being Donald E. Knuth's dlx1.w; a CWEB implementation of his Algorithm X. The computational theory of polycube packings is covered in § in Volume 4B of The Art of Computer Programming; see in particular exercise–266. $\endgroup$ Oct 25, 2023 at 23:14

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .