For questions related to the iterative deepening A* (IDA*) search algorithm, which is a combination of iterative deepening depth-first search (IDDFS) and A*.
Questions tagged [ida-star]
3 questions
6
votes
1 answer
How is iterative deepening A* better than A*?
The iterative deepening A* search is an algorithm that can find the shortest path between a designated start node and any member of a set of goals.
The A* algorithm evaluates nodes by combining the cost to reach the node and the cost to get from…
Huma Qaseem
- 179
- 1
- 3
- 12
2
votes
1 answer
When does IDA* consider the goal has been found?
I was reading about IDA* and I found this link explaining IDA* and providing an animation for it.
Here is a picture of the solution.
I know what is the cutoff condition (it depends on F), and the search is like DFS if the value of (f) of the node…
yaminoyuki
- 217
- 1
- 6
1
vote
1 answer
Doesn't the number of explored nodes with IDA* increase linearly?
I think I'm misunderstanding the description of IDA* and want to clarify.
IDA* works as follows (quoting from Wiki):
At each iteration, perform a depth-first search, cutting off a branch when its total cost exceeds a given threshold. This threshold…
Edward Garemo
- 111
- 2