What is iterative Deepening Depth-First Search Algorithm?

To perform this search we need to follow steps. As it performs the DFS starting to level 1, starts and then executes a complete depth-first search to level 2. Moreover, we have to continue searching process till we find the solution. We have to generate nodes till single nodes are created. Also, it saves the 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.