Editing Maze generation algorithm (section)

==== Recursive implementation ====
[[File:Hexamaze.webm|thumb|Randomized depth-first search on a hexagonal grid]]
The [[depth-first search]] algorithm of maze generation is frequently implemented using [[backtracking]]. This can be described with a following [[recursion (computer science)|recursive]] routine:

#  Given a current cell as a parameter
#  Mark the current cell as visited
#  While the current cell has any unvisited neighbour cells
##  Choose one of the unvisited neighbours
##  Remove the wall between the current cell and the chosen cell
##  Invoke the routine recursively for the chosen cell

which is invoked once for any initial cell in the area.