Maze Algorithms (1997)
36 points
2 days ago
| 3 comments
| astrolog.org
| HN
GavinAnderegg
5 hours ago
[-]
This is a great list! A while back I also enjoyed reading “Mazes for Programers” and playing around with different maze generation algorithms from that book over a holiday break. The book isn’t super deep, but it has a fun set of projects and further ideas/reading as well. https://pragprog.com/titles/jbmaze/mazes-for-programmers/
reply
signa11
22 minutes ago
[-]
couple that with the "the ray tracer challenge" book, and you can generate some pretty cool images :o)
reply
tomhow
5 hours ago
[-]
Previously:

Maze Algorithms (1997) - https://news.ycombinator.com/item?id=10101728 - Aug 2015 (10 comments)

reply
fjfaase
5 hours ago
[-]
Are there also algorithms for (incremental) generation of infinite mazes?
reply
fc417fc802
4 hours ago
[-]
What would it mean for a maze to be infinite? It seems to me that a key part of the concept is having a goal to reach.

Although I guess you could have an infinitely large map and an algorithm that guaranteed connectivity. Infinite ways to fail to reach the goal. But I doubt there would be much practical benefit.

To actually answer your question it should be fairly easy to convert nearly any existing algorithm to cover an infinite area by simply tiling it. A common method to avoid boundary issues is to overlap the tiles slightly.

reply