Define game. Write the benefits and limitations of depth limited search.

Benefits of DLS are;

1.Depth limited search is more efficient than DFS, using less time and memory.
2.If a solution exists, DFS guarantees that it will be found in a finite amount of time.
3.To address the drawbacks of DFS, we set a depth limit and run our search technique repeatedly through the search tree.
4.DLS has applications in graph theory that are highly comparable to DFS.

Limitations of DLS are;

1. It is not complete if the solution is below the limit L (d<l), because it cannot find the soln.

2. It may not find the optimal if there are more than soln.

3. It is not time efficient since it takes O(b^L).

4. It may cause loops if tree search used on the graph.