Related Algorithms
Similar to iterative deepening is a search strategy called iterative lengthening search that works with increasing path-cost limits instead of depth-limits. It expands nodes in the order of increasing path cost; therefore the first goal it encounters is the one with the cheapest path cost. But iterative lengthening incurs substantial overhead that make it less useful than iterative deepening.
Read more about this topic: Iterative Deepening Depth-first Search
Famous quotes containing the word related:
“The content of a thought depends on its external relations; on the way that the thought is related to the world, not on the way that it is related to other thoughts.”
—Jerry Alan Fodor (b. 1935)