Questions tagged [iterative-deepening-a-star]

For questions related to the iterative deepening A* search algorithm.

Filter by
Sorted by
Tagged with
1
vote
1answer
25 views

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 ...
5
votes
1answer
4k views

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 ...