|
||||||
|
||||||
| Undergraduate Honours Projects | ||||||
|
Carleton University - School of Computer Science Undergraduate Honours Project Summer 2011 Algorithms for Generating Random Mazes Matthew Eastman 
ABSTRACT A maze is a form of logic puzzle where the player has to to find a route from one location in the maze to another by navigating an intricate series of branching passages. We are interested in the problem of generating a random maze. We show that this problem is equivalent to the problem of finding a random spanning tree of a planar graph. This report provides a brief overview of the various ways in which a random spanning tree can be generated. |
||||||
|
