| ▲ | Maze Generation: Recursive Division (2011)(weblog.jamisbuck.org) | |
| 17 points by homarp 3 days ago | 3 comments | ||
| ▲ | spencerflem an hour ago | parent | next [-] | |
My favorite maze algorithm is this one: https://cs.wellesley.edu/~pmwh/papers-fcpcg/presentation/sli... Live demo at: https://cs.wellesley.edu/~pmwh/hydrodendron/ It allows generating an infinite maze looking at any arbitrary area of the maze, without any loops, using fractal coordinates | ||
| ▲ | vintagedave 2 hours ago | parent | prev | next [-] | |
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. | ||
| ▲ | hinkley 2 hours ago | parent | prev [-] | |
Reminds me a little of Hilbert curves. 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. | ||