🔗 Red Blob Games: Introduction to A*

python reading-list

Graph search algorithms let us find the shortest path on a map represented as a graph. Move the blob (start point) and cross (end point) to see the shortest path found by the A* Algorithm:

A* is one of a family of related graph search algorithms:

Breadth First Search explores equally in all directions.

Dijkstra's Algorithm takes into account movement costs.

A* explores more towards a single destination.

In addition to finding a shortest path, these algorithms can be used for distance maps, flow field pathfinding, connected components, map analysis, garbage collection algorithms, flow networks, and procedural map generation. There are many optimizations and specializations of these algorithms.

continue reading on www.redblobgames.com

⚠️ This post links to an external website. ⚠️

If this post was enjoyable or useful for you, please share it! If you have comments, questions, or feedback, you can email my personal email. To get new posts, subscribe use the RSS feed.