#Java maze generator algorithm generator
Second, computer traverses F using a chosenĪlgorithm, such as a depth-first search, coloring the path red.ĭuring the traversal, whenever a red edge crosses over a blue edge,įinally, when all vertices of F have been visited, F is erasedĪnd two edges from G, one for the entrance and one for the exit, are removed.Īnimation of generator using depth-first search The animation shows the maze generation steps for aįirst, the computer creates a random planar graph G Loops, which can confound naive maze solvers, may be introduced by adding random edges to the result during the course of the algorithm. Because of this, maze generation is often approached as generating a random spanning tree. If the graph contains loops, then there may be multiple paths between the chosen nodes. If the subgraph is not connected, then there are regions of the graph that are wasted because they do not contribute to the search space.
The purpose of the maze generation algorithm can then be considered to be making a subgraph in which it is challenging to find a route between two particular nodes. This predetermined arrangement can be considered as a connected graph with the edges representing possible wall sites and the nodes representing cells.
Animation of graph theory based method (randomized depth-first search)Ī maze can be generated by starting with a predetermined arrangement of cells (most commonly a rectangular grid but other arrangements are possible) with wall sites between them.
0 kommentar(er)
