Maze Algorithms

-- NOTE -- I am currently reworking the algorithms and systems to make them more efficient, however this means that currently the solver is not working and has been temporarily disabled. Click on an algorithm to generate a maze, click draw to draw the maze out as it is generated, and solve to run the solver. The solver may be slow on larger mazes, especially the recursive backtracker, just give it some time. Instantly generated mazes are 64*64, drawn out mazes are 32x32. A maze must be fully generated before a new maze can be created. All algorithms generate "perfect mazes", meaning every point is accessible on the map and there are no loops. Algorithms implemented so far: Binary tree - super simple, trivial, but extremely fast algorithm. Generates mazes with an obvious pattern Recursive Backtracker- Very simple, very fast and very efficient. Generates long, twisting mazes with few dead-ends Prim's Algorithm- Somewhat slower and less efficient. Generates lots of