A* search algorithm

Summary

A* search algorithm is a pathfinding algorithm^[1]. It draws 1,122 Wikipedia views per month (pathfinding_algorithm category, ranking #2 of 5).^[2]

Key Facts

• A* search algorithm is credited with the discovery of Peter E. Hart^[3].
• A* search algorithm is credited with the discovery of Nils John Nilsson^[4].
• A* search algorithm is credited with the discovery of Bertram Raphael^[5].
• A* search algorithm's video is recorded as Astar progress animation.gif^[6].
• A* search algorithm's image is recorded as Pathfinding A Star.svg^[7].
• A* search algorithm's instance of is recorded as pathfinding algorithm^[8].
• A* search algorithm's instance of is recorded as graph algorithm^[9].
• A* search algorithm's instance of is recorded as complete search algorithm^[10].
• A* search algorithm's instance of is recorded as admissible search algorithm^[11].
• A* search algorithm's based on is recorded as Dijkstra's algorithm^[12].
• A* search algorithm's subclass of is recorded as best-first search^[13].
• A search algorithm's Commons category is recorded as A search algorithm^[14].
• A* search algorithm's publication date is recorded as +1968-00-00T00:00:00Z^[15].
• A* search algorithm's Freebase ID is recorded as /m/0plrp^[16].
• A search algorithm's Commons gallery is recorded as A Algorithm^[17].
• A* search algorithm's described by source is recorded as Artificial Intelligence: A Modern Approach^[18].
• A* search algorithm's has characteristic is recorded as optimal^[19].
• A* search algorithm's computes solution to is recorded as pathfinding^[20].
• A* search algorithm's computes solution to is recorded as shortest path problem^[21].
• A* search algorithm's uses is recorded as graph data structure^[22].
• A search algorithm's Quora topic ID is recorded as A-Algorithm^[23].
• A search algorithm's Quora topic ID is recorded as A-Search-Algorithm^[24].
• A* search algorithm's worst-case time complexity is recorded as \mathcal{O}(|A|log(|S|)) = \mathcal{O}(b^d)^[25].
• A* search algorithm's worst-case time complexity is recorded as \mathcal{O}(2^{|S|})^[26].
• A* search algorithm's worst-case space complexity is recorded as \mathcal{O}(|S|) = \mathcal{O}(b^d)^[27].

Body

Designation and Status

Recorded instance of include pathfinding algorithm^[8], graph algorithm^[9], complete search algorithm^[10], and admissible search algorithm^[11].

Cultural Significance

Things named for A search algorithm include iterative deepening A^[28], a pathfinding algorithm^[29]; Simplified Memory-Bounded A^[30], an informed search algorithm^[31]; and Memory-Bounded A^[32], an informed search algorithm^[33].

Why It Matters

A* search algorithm draws 1,122 Wikipedia views per month (pathfinding_algorithm category, ranking #2 of 5).^[2] It has Wikipedia articles in 25 language editions, a strong signal of global cultural recognition.^[34] It is known by 58 alternative names across languages and contexts.^[35]

Entities named for it include iterative deepening A^[28], a pathfinding algorithm^[29]; Simplified Memory-Bounded A^[30], an informed search algorithm^[31]; and Memory-Bounded A*^[32], an informed search algorithm^[33].