←back to thread

Maze Generation: Recursive Division (2011)

(weblog.jamisbuck.org)
46 points homarp | 6 comments | 14 Jan 25 21:03 UTC | HN request time: 0.832s | source | bottom
1. spencerflem ◴[18 Jan 25 00:47 UTC] No.42744758[source]▶
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

replies(2): >>42745665 #>>42747255 #
2. MrLeap ◴[18 Jan 25 03:53 UTC] No.42745665[source]▶
Oh I loath how that first link hijacks the back button.
replies(2): >>42746233 #>>42746312 #
3. spencerflem ◴[18 Jan 25 06:00 UTC] No.42746233[source]▶
Yeah its a weird format for a paper ngl
4. spencerflem ◴[18 Jan 25 06:21 UTC] No.42746312[source]▶
Good news, found it as a more normal paper too:

https://cs.wellesley.edu/~pmwh/papers-fcpcg/FDG2021-Mawhorte...

5. Etherlord87 ◴[18 Jan 25 10:13 UTC] No.42747255[source]▶
The webpage under the first link is an annoying maze too, as if they couldn't make a typical one-dimensional page :D
replies(1): >>42750361 #
6. spencerflem ◴[18 Jan 25 18:42 UTC] No.42750361[source]▶
Its an exciting experiment in non linear communication ;)