This is a working model to visual A* in action with several different algorithms.
Path Finding 0.1.1
A demo visualizing the execution of various path-finding algorithms
Curently five algorithms are included:
- A* (using Manhattan distance)
- A* (using Euclidean distance)
- A* (using Chebyshev distance)
- Bi-Directional Breadth-First-Search
This demo allows you to choose algorithms from above and visualize their execution.
Meanwhile, this is a Client/Server application. You should start the server first and then the client.
Also, you can start the server on one machine and run the client on a different machine, as long as the two machines are connected.
Requires Python 2.6+ and Pygame
Win32 Binary Distribution: