An extended and refined version of the Depth-first search algorithm. To avoid the infinite loop status while execution of the codes, depth limited search algorithm is being executed into a finite set of depth called depth limit.

An example: Order in which the nodes are expanded (limit l = 2)

Properties:

  • Completeness: no, if l < d 
  • Optimality (Admissibility): no, if l < d 
  • Time Complexity: O(bl)
  • Space Complexity: O(bl), b – branching factor, l – limit, d – depth of the most shallow node