A python visualization of the A* path finding algorithm. It allows you to pick your start, end location and make obstacles and then view the process of finding the shortest path. You can also choose to include or exclude diagonal movement.
- Python 3.x
- You can decide if you want to allow diagonal movement.
- You can also decide if you want instant solution, that means it won’t have any delay in animation while finding path.
- You can set or reset any block very easily. The instruction panel guides you for using the visualizer.