Description : Give the procedure of IDA* search.
Last Answer : Minimize f(n)=g(n)+h(n) combines the advantage of uniform cost search + greedy search A* is complete, optimal. Its space complexity is still prohibitive. Iterative improvement algorithms keep only a ... a depth limit. Thus each iteration expands all nodes inside the contour for the current f-cost.