iterative deepening A*

Summary

iterative deepening A is a pathfinding algorithm^[1]. iterative deepening A draws 59 Wikipedia views per month (pathfinding_algorithm category, ranking #5 of 5).^[2]

Key Facts

• iterative deepening A* is credited with the discovery of Richard E. Korf^[3].
• iterative deepening A*'s instance of is recorded as pathfinding algorithm^[4].
• iterative deepening A*'s instance of is recorded as informed search algorithm^[5].
• iterative deepening A*'s instance of is recorded as graph algorithm^[6].
• A search algorithm is named after iterative deepening A^[7].
• iterative deepening A*'s based on is recorded as iterative deepening depth-first search^[8].
• iterative deepening A's subclass of is recorded as A search algorithm^[9].
• iterative deepening A*'s Freebase ID is recorded as /m/09g9zmz^[10].
• iterative deepening A*'s described by source is recorded as Artificial Intelligence: A Modern Approach^[11].
• iterative deepening A*'s described by source is recorded as Depth-first iterative-deepening: an optimal admissible tree search^[12].
• iterative deepening A*'s computes solution to is recorded as shortest path problem^[13].
• iterative deepening A*'s uses is recorded as tree^[14].

Body

Designation and Status

Recorded instance of include pathfinding algorithm^[4], informed search algorithm^[5], and graph algorithm^[6].

History and Context

A search algorithm is named after iterative deepening A^[7].

Why It Matters

iterative deepening A draws 59 Wikipedia views per month (pathfinding_algorithm category, ranking #5 of 5).^[2] iterative deepening A has Wikipedia articles in 5 language editions, a strong signal of global cultural recognition.^[15] iterative deepening A* is known by 3 alternative names across languages and contexts.^[16]