KnowraA* search algorithmLinked fromLinked fromThe 8 pages that link to A* search algorithm, each with the reason it gives.All 8Related 5Compared with 3Shortest path problemRelated: An admissible heuristic can focus a single-pair search without sacrificing optimality.Breadth-first searchCompared with: Unlike breadth-first search, it uses goal-directed estimates and can handle weighted costs.Dijkstra's algorithmCompared with: It adds goal-directed guidance when only a route to a particular destination is needed.HeuristicRelated: Its heuristic estimate directs exploration; suitable estimates can also preserve optimality.Priority queueRelated: Its frontier is ordered by estimated total path cost.Artificial intelligence in video gamesRelated: Game agents use it to find routes across maps and navigation graphs.Floyd–Warshall algorithmCompared with: A* targets a particular route rather than precomputing distances for every pair.Sliding puzzleRelated: A* uses tile-distance estimates to find short solutions efficiently.