Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 235,680,333 papers from all fields of science
Search
Sign In
Create Free Account
Iterative deepening A*
Known as:
IDA*
, Ida
Iterative deepening A* (IDA*) is a graph traversal and path search algorithm that can find the shortest path between a designated start node and any…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
7 relations
A* search algorithm
Automated planning and scheduling
Dynamic programming
Fringe search
Expand
Search for papers about Iterative deepening A*
Search papers