Depth-first search with a limit. This is useful if we know the solution is shallower than limit \(l\).
Informed: No
Time:
Space:
Complete:
Optimal:
Does a depth-limited search to a layer \(L\), increases the layer and starts again. The repeats are a waste, but earlier layers are much cheaper.
Informed: No
Time:
Space:
Complete:
Optimal: