Maze Generation Algorithm - Recursive Backtracker

Published on Sunday, July 13, 2014


How to generate random mazes using the Recursive Backtracker algorithm. This tutorial describes the simplest maze generator algorithm using a stack and depth-first searching. I show an implementation using JavaScript. Keep in mind that this algorithm, although it is very easy to code and understand, results in very complex mazes (the maze will be more difficult to solve as it gets bigger), you can create much more complicated labyrinths using other algorithms. Depending on your requirements, this should be enough, however. LIVE DEMO: The algorithm (source: WikiPedia) The depth-first search algorithm of maze generation is frequently implemented using backtracking: 1. Make the initial cell the current cell and mark it as visited 2. While there are unvisited cells 2.1. If the current cell has any neighbors which have not been visited 2.1.1. Choose randomly one of the unvisited neighbors 2.1.2. Push the current cell to the stack 2.1.3. Remove the wall between the current cell and the chosen cell 2.1.4. Make the chosen cell the current cell and mark it as visited 2.2. Else if stack is not empty 2.2.1. Pop a cell from the stack 2.2.2. Make it the current cell 2.3. Else 2.3.1. Pick a random unvisited cell, make it the current cell and mark it as visited Programming tutorials by Easy Learn Tutorial - because anyone can learn how to become an expert software and web developer! Copyright (c) 2013 Rodrigo Silveira -

Copyright © 2014-2017 EasyLearnTutorial. All rights reserved.