Randomized conways game of life generator#

When at a dead-end it backtracks through the path until it reaches a cell with an unvisited neighbour, continuing the path generation by visiting this new, unvisited cell (creating a new junction). The computer continues this process, with a cell that has no unvisited neighbours being considered a dead-end. The computer removes the wall between the two cells and marks the new cell as visited, and adds it to the stack to facilitate backtracking. Starting from a random cell, the computer then selects a random neighbouring cell that has not yet been visited. Consider the space for a maze being a large grid of cells (like a large chess board), each cell starting with four walls. This algorithm, also known as the 'recursive backtracker' algorithm, is a randomized version of the depth-first search algorithm.įrequently implemented with a stack, this approach is one of the simplest ways to generate a maze using a computer.

Randomized conways game of life generator#

Randomized depth-first search Animation of generator using depth-first search A different animation of a generator using depth-first search Second, the 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. 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. Graph theory based methods 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.

This maze generated by modified version of Prim's algorithm, below. Maze generation algorithms are automated methods for the creation of mazes.

JSTOR ( March 2018) ( Learn how and when to remove this template message).

Unsourced material may be challenged and removed.įind sources: 'Maze generation algorithm' – news Please help improve this article by adding citations to reliable sources. This article needs additional citations for verification.