A* (pronounced as “A star”) is a computer algorithm that is widely used in pathfinding and graph traversal. The algorithm efficiently plots a walkable path between multiple nodes, or points, on the graph. It’s used to handle real-life pathfinding scenarios. Most NPCs and AI players rely on A* to intelligently search for a path, fast and efficient.
A search relies on a knowledge and heuristic cost function for the given node as a way to decide which node it should visit next. In most cases, this cost function is denoted as f(x)
. A is an extension of Dijkstra’s algorithm with some characteristics of breadth-first search (BFS).