Intermediate · Research
A* search
Visual diagram · (in preparation) · Math · (in preparation) · Worked example · 3 difficulty levels.
TL;DR. A* search is a pathfinding algorithm that finds the shortest path between two points in a graph.
Technical Definition
A* search is a pathfinding algorithm that finds the shortest path between two points in a graph.
How it works
Pronounced "A-star", this is a graph traversal and pathfinding algorithm. It is widely used in computer science for its guarantee of finding the optimal path, meaning the shortest one, and for its efficiency.
Related Concepts
- Algorithm — A finite, well-defined sequence of steps used to learn from data or solve a computational problem.
- Graph theory — The study of graphs, which are mathematical structures used to model relationships between objects.
- Pathfinding — The process of automatically determining the shortest or most efficient route between two points, often in a graph or map.