Can somebody explain about **Iterative Deepening A***? I still don't understand how it works. **Iterative deepening** search w/ **Depth First Search**, and If still not found the solution; increase the **Depth**++ until found solution.

If Iterative deepening using **Depth**, then Iterative Deepening A* use what to limit their search?

Here is a picture if you need to explain how it IDA* Works, I just don't understand how it works.

**(1,2,4,9)** and etc is the step

0+2=2 is **f(n)=g(n)+h(n)**