Started as a college assignment: build a perfect maze generator and solver in C++ — self-taught for the project. Once it worked, I kept going — 3D, then a 2D blueprint representation of 3D space, then any number of dimensions.
The key insight: each extra dimension is just another axis where a node can move ±1. Any N-dimensional grid is a graph, and its spanning tree is a perfect maze.
The project sat for years. Recently rebuilt the visualizer in JavaScript with 3D rendering.
Higher dimensions (w, v, u…) are projected as offset vectors into 3D space — like shadows of a higher-dimensional structure.
n limits exist because rendering is expensive — 9D n=3 is already 19,683 nodes. At max settings, solving can take a few minutes (the browser processes multiple steps per frame, so it often goes faster).