Iterative Deepening Depth-First Search

FreelancingGig — [October 10, 2017](/content/blog/glossary/iterative-deepening-depth-first-search/ "Permalink to Iterative Deepening Depth-First Search"/index.html)

It performs depth-first search to level 1, starts over, executes a complete depth-first search to level 2, and continues in such way till the solution is found.

It never creates a node until all lower nodes are generated. It only saves a stack of nodes. The algorithm ends when it finds a solution at depth d. The number of nodes created at depth d is bd and at depth d-1 is bd-1.

Next post Informed (Heuristic) Search Strategies Previous post Uniform Cost Search