Iterative Deepening Depth First Search in AI

It is a general strategy often used in combination with DFS that finds the best depth limit. It begins by performing DFS to a graph of one, then the depth of two, depth of three, and so on, until a solution is found or some maximum depth is reached. It combines the benefits of both BFS and DFS.

Iterative Deepening Depth First Search Algorithm:

Step1: Start
Step2: Initialize d←0
Step3: do
d←d+1;
DFID(root, d);
Until SUCCESS;
Step4: End