neocomputer.org personal blog

Eller’s Algorithm (2012)

Eller's algorithm creates 'perfect' mazes, having only a single path between any two cells, one row at a time. The algorithm itself is incredibly fast, and far more memory efficient than other popular algorithms (such as Prim's and Kruskal's) requiring storage proportional to only a single row. This makes it possible…
Points
217
HN comments
27
Submissions
1
Cited by
0 commenters

Math & AlgorithmsSoftware Engineering2019

On Hacker News

SubmittedTitle on HNPointsComments
Dec 18, 2019Eller’s Algorithm (2012) by sanj21727

More from neocomputer.org

All 2 posts →

Related posts from the same era