I made this project so that I can learn more about different kinds of pathfinding algorithms. Check the online demo
A-star (also referred to as A*) is one of the most successful search algorithms to find the shortest path between nodes or graphs. ... When a search algorithm has the property of optimality , it means it is guaranteed to find the best possible solution .
- Manhattan (default): more info
- Diagonal Chebyshev: more info
- Diagonal Octile: more info
- Euclidean: more info
- Euclidean Squared: more info
Pathfinding or pathing is the plotting, by a computer application, of the shortest route between two points. It is a more practical variant on solving mazes. This field of research is based heavily on Dijkstra's algorithm for finding the shortest path on a weighted graph.
Pathfinding is closely related to the shortest path problem, within graph theory, which examines how to identify the path that best meets some criteria (shortest, cheapest, fastest, etc) between two points in a large network.
Thanks goes to these wonderful people (emoji key):
Janno De Jesus 🚧 |
This project follows the all-contributors specification. Contributions of any kind welcome!