Here is a 5 x 5 x 5 cube filled with numbers.
It's a 3D adaption of standard slitherlink puzzles.
You must create a solid 3D object such that the number in each sub-cube matches the number of adjacent faces.
You can assume that the surface will never touch itself except at connections.

enter image description here I'm 90% sure that this has a unique solution.

It might very well be possible to remove some numbers and still have a valid solution, but since this is a new puzzle type (as far as I know) I'll give all the information.

Please let me know what you think and most importantly, have fun!

  • 1
    $\begingroup$ Just to be clear, the layers are meant to be stacked left to right (so the lower-left layer is adjacent to the top right layer), correct? $\endgroup$
    – Woofmao
    Commented Jan 26, 2020 at 20:50
  • $\begingroup$ That is correct, I'll add layer numbers shortly :) $\endgroup$ Commented Jan 26, 2020 at 20:51
  • $\begingroup$ My apologies, I just discovered some errors in layer 1. They are now fixed. I hope this doesn't set anyone back too far! $\endgroup$ Commented Jan 26, 2020 at 21:42
  • $\begingroup$ Layer 2 needed fixing too, it should all be correct now $\endgroup$ Commented Jan 26, 2020 at 21:50
  • 1
    $\begingroup$ As a side note, the 3d slitherlink has been done before in MIT Mystery Hunt, 2016 (web.mit.edu/~puzzle/www/2016/puzzle/cubism) $\endgroup$
    – phenomist
    Commented Jan 27, 2020 at 3:03

1 Answer 1


I started from the top layer, and the rest soon fell into place. GRATS

  • $\begingroup$ Congratulations! When I tested it I began from the bottom. $\endgroup$ Commented Jan 27, 2020 at 2:41
  • $\begingroup$ Quite a fun puzzle. I enjoy Slitherlink, and this was a tough one. Having all the clues present made filling the remaining layers much easier than the first layer, but the first layer was really difficult. $\endgroup$
    – Woofmao
    Commented Jan 27, 2020 at 2:47

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.