This is a A* Path Finder implementation using manhattan distance with a GUI for visualization.
Built using Python3 and PyGame.
- First click sets the start node.
- Second click sets the end node.
- Create walls by clicking or by clicking and dragging.
- Enter finds the shortest path.
- Backspace resets everything.
- Fix minor bugs with gui.
- Visualize how the algorithm finds the shortest path.