3 comments
My favorite maze algorithm is this one: <a href="https://cs.wellesley.edu/~pmwh/papers-fcpcg/presentation/slides.html#/labyrinfinite" rel="nofollow">https://cs.wellesley.edu/~pmwh/papers-fcpcg/presentation/sli...</a><p>Live demo at: <a href="https://cs.wellesley.edu/~pmwh/hydrodendron/" rel="nofollow">https://cs.wellesley.edu/~pmwh/hydrodendron/</a><p>It allows generating an infinite maze looking at any arbitrary area of the maze, without any loops, using fractal coordinates
Remarkably simple with great results. I recommend checking out the author’s book Mazes for Programmers: one of the best programming books I’ve ever read. Incredibly clearly explained, and very interesting, which is an excellent combination.
Reminds me a little of Hilbert curves.<p>It would be kind of cool to generate an 'infinite' maze this way by starting the process and only recursing to max depth only for the nodes closest to the exits.