Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

7 relations
A* search algorithmAutomated planning and schedulingDynamic programmingFringe search

Search for papers about Iterative deepening A*

Search papers
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)