A simple and interactive pathfinding visualizer built with Python, Matplotlib, and NumPy. It compares how A* and DFS (Backtracking) algorithms navigate through a grid with obstacles using smooth animations.
Visualize A* and DFS algorithms
Animated movement with step counter
Obstacle-filled grid environment
Start and goal markers
Button to switch between algorithms
Clean and easy-to-understand visualization
Python
Matplotlib
NumPy
Heapq (Priority Queue)