The Full Wiki

Depth-limited search: Wikis


Note: Many of our articles have direct quotes from sources you can cite, within the Wikipedia article! This article doesn't yet, but we're working on it! See more info or our list of citable articles.


From Wikipedia, the free encyclopedia

Depth-limited search
Class Search Algorithm
Data structure Graph
Worst case performance O( | V | + | E | )
Graph search algorithms and Tree search algorithms

In computer science depth-limited search is an algorithm to explore the vertices of a graph. It is a modification of depth-first search and is used for example in the iterative deepening depth-first search algorithm.



Like the normal depth-first search, depth-limited search is an uninformed search. It works exactly like depth-first search, but avoids its drawbacks regarding completeness by imposing a maximum limit on the depth of the search. Even if the search could still expand a vertex beyond that depth, it will not do so and thereby it will not follow infinitely deep paths or get stuck in cycles. Therefore depth-limited search will find a solution if it is within the depth limit, which guarantees at least completeness on all graphs.

Algorithm (informal)

  1. Determine the vertex where the search should start and assign the maximum search depth
  2. Check if the current vertex is the goal state
    • If not: Do nothing
    • If yes: return
  3. Check if the current vertex is within the maximum search depth
    • If not: Do nothing
    • If yes:
      1. Expand the vertex and save all of its successors in a stack
      2. Call DLS recursively for all vertices of the stack and go back to Step 2

Algorithm (formal)

DLS(node, goal, depth)
  if (node == goal)
    return node;
  while (stack is not empty)
    node' := pop(stack);
    if (node'.depth() < depth)
       stack := expand (node)
       DLS(node', goal, depth);
        // no operation



Space complexity

Since depth-limited search internally uses depth-first search the space complexity is equivalent to that of normal depth-first search.

Time complexity

Since depth-limited search internally uses depth-first-search the time complexity is equivalent to that of normal depth-first search, and is O( \vert V \vert + \vert E \vert ) where  \vert V \vert stands for the number of vertices and  \vert E \vert for the number of edges in the explored graph. Note that depth-limited search does not explore the entire graph, but just the part that lays within the specified bound.


Even though depth-limited search cannot follow infinitely long paths, nor can it get stuck in cycles, in general the algorithm is not complete since it does not find any solution that lies beyond the given search depth. But if you choose the maximum search depth to be greater than the depth of a solution the algorithm becomes complete.


Depth-limited search is not optimal. It still has the problem of depth-first search that it first explores one path to its end, thereby possibly finding a solution that is more expensive than some solution in another path.



Got something to say? Make a comment.
Your name
Your email address