Questions tagged [ida-star]

For questions related to the iterative deepening A* (IDA*) search algorithm, which is a combination of iterative deepening depth-first search (IDDFS) and A*.

Filter by
Sorted by
Tagged with
2
votes
1answer
95 views

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 ...
1
vote
1answer
59 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 ...
6
votes
1answer
8k 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 ...