Pathfinding is a grid based project that visualize paths of searching algorithms, written in pygame.
Requires python and pygame installed locally.
To run this project, open cmd (Windows)/ terminal (Linux) and run:
$ cd "directory of project"
$ python Main.py
-
Left Mouse / W Key: to place a Wall grid
-
Right Mouse / D Key: to place End Marker
-
Middle Mouse / L Key : to place Start Marker
- Q Key to place Weighted Wall
- A Key to toggle full path of arrows
- E Key to toggle explored area
- M Key to animate the path
- P Key to print out the wall list ( in case, users want to save their own maps to reuse after closing )
- Esc Key to exit
Home
Straight Path
Diagonal Path
Implements path finding algorithms:
- BFS
- DFS
- Greedy B*
- A* Euclidean
- A* Manhattan
- A* Diagonal
- Dijkstra
Created by Henry Ta