Moves:

The objective is to get from the top of the circle to the bottom. This maze is recursive, but the circle only exists on the top level of the maze.

This maze was invented by the (clearly) brilliant Mark J. P. Wolf, and I found it here, and a couple of solutions here. Like snakes, code and documentation is available.

These first two solutions come from the internet: a From here.
I like this solution because it uses all 3 immediate submazes in their canonical order (they used to be labeled A,B,C clockwise from top left). Here's another one with a simpler traversal through the first Red submaze. and a From here.
This is an easy solution to memorize: right through red, over to blue, in red twice, unwind around, up and left, back into red, in-and-out to the bottom, and out. one. Armed with this toy and a couple solutions, I set out to find my A good way of solving these is to pick a top-level path and just go for it. Identify sub-goals as you recurse in and the challenge becomes keeping track of which subgoal you're solving as you unwind. With a little persistence, I believe most if not all paths are actually connected. This solution is noteworthy because of the complexity of the red submaze's path compared that of the blue submaze. solution, and a chai later I found my I like this one because of the fairly even balance of complexity between the red and blue submaze traversals. and This path targeted the little roundabout on the east side of the blue submaze, which had been unused (at any depth) in all my previously known solutions. When I replayed this maze, I noticed that the path only crosses itself once, a trait also shared with the 'short' solution from the internet. I hypothesized the existence of a non-crossing solution, and I managed to find one. . Then I Long paths are long and fun. Long paths are long and fun. for a Another solution developed by picking a target and following it, in this case the green-line red-to-blue submaze connection. . Worst PATH EVER. (PAX East 2010)