Seems like every CS student has to do this project someday. I added a few algorithms that I can't find in this kind of projects to make it at least different from the rest 🤷♂️.
First two squares are the source 🟧 and the end square 🟦, after that everything is barrier (gray square). Draw with left mouse button, erase with right mouse button.
| A | A* |
| B | Breadth First Search (BFS) |
| C | Clean or stop algorithm |
| D | Depth First Search (DFS) |
| F | Greedy Best First Search (GBFS) |
| I | Iterative Deepening Depth First Search (IDDFS) |
| J | Iterative Deepening A* (IDA*) |
| K | Dijkstra |
| L | Bidirectional BFS |
| M | Create maze. Change algorithm inside game/game.py |
| Q | Quit or stop algorithm |
| R | Rapidly Exploring Random Tree (RRT) 🔝 |