quote:

From the article:

Click here to view the secret text

×

Oops, I guess I didn't read it thoroughly. Too much stuff mentioned inside.

I suppose the algorithm is like this?

Click here to view the secret text

×Suppose we always look at the direction we just moved. Then for the set of all possible directions of movement, we order them carefully, and in every turn, try them from the first in the list to the last, and take the first move that can be made.

Right-hand rule is a set ordered as [right, forward, left backward]. For higher dimension just add their respective directions onto the list.

quote:

A maze constructed on the surface of a Torus

Hey, we haven't even mentioned general topological spaces yet, where regions are defined to connect to each other in peculiar ways, including one-way connections! I once did a thorough thinking about mazes in general topological spaces, and basically, if you actually try to map out such areas, you might get aperiodic tiling like

Wang tiles, which means you need to look infinitely forward to actually determine where exactly you are!