11 votes
Accepted

How is iterative deepening A* better than A*?

A* is a best-first search algorithm, which means that it is an algorithm that uses both "past knowledge", gathered while exploring the search space, denoted by $g(n)$, and an admissible heuristic ...
user avatar
  • 33.8k
1 vote
Accepted

When does IDA* consider the goal has been found?

According to Artificial Intelligence: A Modern Approach 4th edition in IDA* the cutoff is the $f$-cost($g+h$); at each iteration, the cutoff value is the smallest $f$-cost of any node that exceeded ...
user avatar

Only top scored, non community-wiki answers of a minimum length are eligible