Please enter Maze dimesions below
Developed by David Bruce Wilson, this algorithm is a method of generating uniform spanning trees(UST) on a graph, which makes it really good at creating unbiased mazes because every possible maze has an equal probability of being generated.
It starts by selecting an arbirary vertex to form the inital tree, then picks a random vertex not in the tree and does a random walk until it hits the already exising tree. Any loops formed during the walk are erased and the simple path is added to the tree and this repeates untill all vertieces in the graph are included.
This is effective for creating unbiased mazes, but it can be slow espeically when it just starts out.
The Maze solver uses Breadth-first search (BFS) which searches all it's nearest neighbords before going to the next depth to find the shortest path to the end