jeffx13 / maze-game

A maze generation algorithm visualiser.

A maze generation and pathfinding algorithm visualiser

Maze-Generating Algorithms

• Aldous-Broder Algorithm
• Binary Tree Algorithm
• Depth First Search
• Eller's Algorithm
• Hunt And Kill Algorithm
• Randomised Kruskal's Algorithm
• Randomised Prim's Algorithm
• Recursive Backtracking
• Sidewinder
• Wilson's Algorithm

Maze-Pathfinding Algorithms

• A* Search Algorithm
• Breadth First Search
• Dead End Filling
• Depth First Search
• Wall Follower

Key	Algorithm
1	Aldous-Broder Algorithm
2	Binary Tree Algorithm
3	Depth First Search
4	Eller's Algorithm
5	Hunt And Kill Algorithm
6	Kruskal's Algorithm
7	Prim's Algorithm
8	Recursive Backtracking
9	Sidewinder Algorith
0	Wilson's Algorith
Numpad 1	A* Search Algorithm
Numpad 2	Breadth First Search
Numpad 3	Dead End Filling
Numpad 1	Depth First Search
Numpad 4	Wall Follower

Controls:

Key	Action
Right-Click	Sets the start cell for maze generation and resets the maze
D	Advances the maze generation algorithm by one step and draws maze
E	Visualise generation; click any mouse button or press esc or Space to stop
G	Generates the maze
R	Resets the maze
Left-Click	Marks the cell as the start or end cell for pathfinding - start cell will be placed first
S	Visualise pathfinding
F	Finds the path from start to end and draws the path
C	After the path has been found and drawn, clears the path

TODO:

• Implement Eller's Algorithm
• Implement Wilson's Algorithm
• Implement Sidewinder Algorithm
• Implement DFS as a pathfinding algorithm
• Implement Dead-end filling algorithm
• Implement Wall follower algorithm

References

[1] Jamis Buck - Mazes for Programmers
[2] Maze-solving algorithm
[2] Maze generation algorithm