Editing Maze generation algorithm (section)

=== Aldous-Broder algorithm ===

The Aldous-Broder algorithm also produces uniform spanning trees. However, it is one of the least efficient maze algorithms.<ref>
{{cite web |author=Jamis Buck |title=Maze Generation: Aldous-Broder algorithm |url=https://weblog.jamisbuck.org/2011/1/17/maze-generation-aldous-broder-algorithm |date=17 January 2011}}
</ref>

# Pick a random cell as the current cell and mark it as visited. 
# While there are unvisited cells: 
## Pick a random neighbour. 
## If the chosen neighbour has not been visited: 
### Remove the wall between the current cell and the chosen neighbour. 
### Mark the chosen neighbour as visited. 
## Make the chosen neighbour the current cell.