In a iterative deepening search (IDS, why is it needed to regenerate the l levels of a tree when using depth limited searching with L+1 limits?
..my guess is because unlike a queue with n-1 limits, if there was a tree with l+1 limits, then the limit is l+1 because it may search at the root of a tree, and if it fails, it will increase the depth by one and search onward.
I'm not sure if I'm on the right track of thinking for this one.
It is a time/space trade off: For a large tree, depth first search is much smaller than breadth first search; but if an early branch holds no answer and is very large (worst case: never stops) then it may run too long. Iteratively deepening with saved state would be the same as breadth first in space (think about it), so if you are trying to save space, you spend time by re-searching the top levels. The wikipedia article seems pretty good to me (I'm no expert).
We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.