A demo visualizing the execution of various path finding algorithms
This is 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)
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+ (2.5 and 3.x is not supported)