Questions tagged [iterative-deepening-a-star]

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

Filter by
Sorted by
Tagged with
4
votes
1answer
2k 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 ...