• IDA* is a depth-first search.
  • It iterates on expected solution length T.
  • Expand a subtree only if it could contain such a solution.
  • Start with lower bound on solution length of root note.
  • If no solution found increase T, until success.

GPW'99, October 16, 1999. Pushing the Limits: New Developments in Single-Agent Search previous up next