Get the latest tech news
Introduction to the A* Algorithm (2014)
Interactive tutorial for A*, Dijkstra's Algorithm, and other pathfinding algorithms
For the explanations on the rest of the page, I’m going to use grids because it’s easier to visualize the concepts, but all of these algorithms and sample code work on non-grids too. Dijkstra’s Algorithm works well to find the shortest path, but it wastes time exploring in directions that aren’t promising. A* doesn’t itself handle things like cooperative movement, moving obstacles, map changes, evaluation of dangerous areas, formations, turn radius, object sizes, animation, path smoothing, or lots of other topics.
Or read this on Hacker News
