Science Fair Project Encyclopedia
Depth-limited search
Depth-limited search is a special case of the Depth-first search, where only nodes with depth not exceeding some bound are examined. Because of this property, the algorithm does not have the possibility of going down an infinite path. However, if the solution has a depth greater than the bound, the algorithm will miss it. As a result, the algorithm is suitable for problems where the solution is known to be no deeper than a certain bound, or at least where it is sufficiently likely to make using the algorithm worthwhile. A more sophisticated version of the algorithm is the Iterative deepening depth-first search, which repeatedly applies the depth-limited search with an increasing depth.
10-26-2009 08:16:03
The contents of this article is licensed from www.wikipedia.org under the GNU Free Documentation License. Click here to see the transparent copy and copyright details
The contents of this article is licensed from www.wikipedia.org under the GNU Free Documentation License. Click here to see the transparent copy and copyright details