Maze Algorithms (2011)

I got interested in mazes late last year and found Mr. Buck&#x27;s resources invaluable. In fact, I received his book for Christmas. I highly recommend it, definitely worth the paperback purchase to support his work.<p>I implemented several of the algorithms for my Rust maze generation tools (<a href="https:&#x2F;&#x2F;github.com&#x2F;animate-object&#x2F;mazes" rel="nofollow">https:&#x2F;&#x2F;github.com&#x2F;animate-object&#x2F;mazes</a>, <a href="https:&#x2F;&#x2F;github.com&#x2F;animate-object&#x2F;maze-cli" rel="nofollow">https:&#x2F;&#x2F;github.com&#x2F;animate-object&#x2F;maze-cli</a>), (and the game I built on top of them <a href="https:&#x2F;&#x2F;github.com&#x2F;animate-object&#x2F;followed" rel="nofollow">https:&#x2F;&#x2F;github.com&#x2F;animate-object&#x2F;followed</a>)

My maze algorithms done in perl more than 10 years ago<p><a href="https:&#x2F;&#x2F;github.com&#x2F;xa-bi&#x2F;mazes" rel="nofollow">https:&#x2F;&#x2F;github.com&#x2F;xa-bi&#x2F;mazes</a>

Several years ago, I wrote a maze generator using POV-Ray [0]. It&#x27;s interesting trying to write a queue in a language that only has simple fixed-length arrays.<p>IMO, the recursive backtracking algorithm looks the best, and I&#x27;d probably use that if I were to ever return to this quick little project.<p>[0]<a href="https:&#x2F;&#x2F;youtu.be&#x2F;VwuA2Z1tCaw" rel="nofollow">https:&#x2F;&#x2F;youtu.be&#x2F;VwuA2Z1tCaw</a>

Recently, I have been working on a maze program (in C++) that generates SVG files that can be used to cut mazes with a laser cutter. I also have been trying to do some statistical analyses on the various algorithms.<p><a href="https:&#x2F;&#x2F;github.com&#x2F;FransFaase&#x2F;MazeGen" rel="nofollow">https:&#x2F;&#x2F;github.com&#x2F;FransFaase&#x2F;MazeGen</a><p>Because this program is for my own experiments, I simply modify the &#x27;main&#x27; function if I want to change some parameters or select another combination of algorithms. See &#x27;all_tests&#x27; for some examples of how the various methods can be called.

The Aldous-Broder algorithm sure is somethin&#x27;.

This might be a stupid question but how can the site run multiple maze generation algorithm at the same time? My understanding is that javascript is single thread.

I feel mazes are a nice hello world project for learning a new programming language. I made one in JavaScript last month when I was setting up a personal web site. I added a maze to the 404 page to show how truly lost you are when you end up there. It is the most interesting page on my web site so far.<p><a href="https:&#x2F;&#x2F;www.schaap.io&#x2F;404.html" rel="nofollow">https:&#x2F;&#x2F;www.schaap.io&#x2F;404.html</a>

Wilson&#x27;s algorithm creates the best mazes by having a variety of short and long passages.

Generating mazes on 3d polyhedra &amp; other surfaces: <a href="http:&#x2F;&#x2F;matthewarcus.github.io&#x2F;polyjs&#x2F;maze.html" rel="nofollow">http:&#x2F;&#x2F;matthewarcus.github.io&#x2F;polyjs&#x2F;maze.html</a>

I got so interested in mazes after the last HN post on Eller&#x27;s algorithm that I actually created and published a real mobile game based on it! (shameless plug: it&#x27;s called &quot;Squashy Squares&quot;)

If you are interested in mazes and maze solving in general, check out <a href="https:&#x2F;&#x2F;www.pathery.com&#x2F;" rel="nofollow">https:&#x2F;&#x2F;www.pathery.com&#x2F;</a>

Are there any algorithms that are not squares or include line art?

Amazeing!