1
Depth limited search algorithm
Similar to DFS but with a predetermined limited
Help in solving the problems DFS like infinite path termination condition
without finding solution.
1. Failure value
Where is no solution
2. Cut of failure
terminates on reaching predetermined depth no solution
Advantages
Memory efficient disadvantages
Disadvantages
Incompleteness
can be terminated without finding solution
Not optimal
it is not important they give best result
Time complexity O(bd)
space complexity O(b*d)
