Github: Maze Solvers
Demo
Description
During my free time, I was asked by my friend to implement a few maze-solving approaches. I thought refreshing some algorithm concepts and learning something new would be fun. As a friend also needed visualisation, I took Unity and C# as my tool.
The following algorithms were implemented:
- Left & Right Hand
- Pledge
- A*
- BFS (Lee’s)
- DFS & Bidirectional-DFS
- Dead-end filler
- Tremaux
- Random
- Soukup (incorrectly used A* instead of DFS)