We need to follow steps to carry out this search in AI. As the DFS starts at level 1, it starts and then carries out a complete depth - first search to level 2. In addition, we must continue to search until we find the solution. We need to generate nodes until we create single nodes. Also, it saves only stack of nodes. As soon as he finds a solution at depth d, the algorithm ends, The number of nodes created at depth d is bd and at depth d-1 is bd-1.
In computer science, iterative deepening search or more specifically iterative deepening depth-first search (IDS or IDDFS) is a state-space/graph search strategy in which a depth-limited version of depth-first search is run repeatedly with increasing depth limits until the goal is found. IDDFS is optimal like a breadth-first search, but uses much less memory; at each iteration, it visits the nodes in the search tree in the same order as depth-first search, but the cumulative order in which nodes are first visited is effectively breadth-first.