# Difference between revisions of "Brain Maze"

From Noah.org

Line 5: | Line 5: | ||

This is a fractal algorithm I created for generating mazes. I think it's pretty neat. The original was written in C for a computer science class I was taking at UCSC. This version is in Python. The original would print spaces and hashes (#) to display the maze. This version also generates HTML. | This is a fractal algorithm I created for generating mazes. I think it's pretty neat. The original was written in C for a computer science class I was taking at UCSC. This version is in Python. The original would print spaces and hashes (#) to display the maze. This version also generates HTML. | ||

− | This generates a random maze with no loops. In fact, it is a [http://en.wikipedia.org/wiki/Spanning_tree_%28mathematics%29 spanning tree] -- a connected, undirected graph that uses all the vertices in | + | This generates a random maze with no loops. In fact, it is a [http://en.wikipedia.org/wiki/Spanning_tree_%28mathematics%29 spanning tree] -- a connected, undirected graph that uses all the vertices in a graph with no cycles. |

You can run the brain maze algorithm by clicking here: [http://www.noah.org/cgi-bin/brainmaze.py brainmaze.py] | You can run the brain maze algorithm by clicking here: [http://www.noah.org/cgi-bin/brainmaze.py brainmaze.py] |

## Revision as of 16:21, 7 December 2007

This is a fractal algorithm I created for generating mazes. I think it's pretty neat. The original was written in C for a computer science class I was taking at UCSC. This version is in Python. The original would print spaces and hashes (#) to display the maze. This version also generates HTML.

This generates a random maze with no loops. In fact, it is a spanning tree -- a connected, undirected graph that uses all the vertices in a graph with no cycles.

You can run the brain maze algorithm by clicking here: brainmaze.py

Click here to download: brainmaze.py <include svncat src="file:///home/svn/src/python/brainmaze.py" highlight="python" />