Here’s a little doodle on a grid based on a standard six-sided die:

I started by deciding that the pip positions should all connect North to south and East to West. It followed logically that I could have a puzzle where the solver could choose one of two possibilities for each empty cell: connecting North to West and South to East, or North to East and South to West. Because there are 33 non-pip squares, there would therefore be 2^{33}=8,589,934,592 ways to fill the grid. The lines on the outside of the grid show how the squares would connect when folded into a cube.

As an exercise, I found a way to make a single circuit, which is shown above. While that turned out to be about the difficulty of puzzle I can handle in something I am solving by hand, I’m sure there are more interesting specimens to be found.

Unfortunately, because the number of pips is odd, it’s impossible to have two circuits where each go through all of the pips. The circuits would have to cross each other an even number of times. But we could have one of the circuits cross itself once, and then have both circuits go through the remaining 20 pips. (Let’s call that problem number, oh what are we on, **#12**. By the way, the problem numbers are so that I can keep track of solvers of numbered problems and give them the fame they deserve. Nobody has solved any yet. You can be the first!)

Another possibility would be to use three circuits, each crossing itself once, and each visiting 12 pips in addition to the self-crossing. That’s **#13**.

I like big, wide ranging circuits here, so a constraint I like is to have circuits that visit all 6 sides. So bonus points on the preceding problem for having all three circuits do that. And that suggests **#14**: Maximize the number of circuits in a solution where all circuits present visit all 6 sides.

I thought early on that I could take this in the direction of a knot theoretical puzzle, but then one would have to keep track of which thread went under which in the crossings, which seemed like an unnecessary complication. I also think it would be interesting to make a multi-state maze (See Robert Abbott’s site for some good examples) using this template, but I haven’t yet had any good ideas for how that would work. If you have a good idea for a variation on this puzzle, I’d love to hear it. (This is of course true for all of my puzzles.)

For your solving convenience, I have an empty grid image here, and the Inkscape SVG file I used to produce it and the image above is here.