General
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.
Read more about this topic: Depth-limited Search
Famous quotes containing the word general:
“I never saw any people who appeared to live so much without amusement as the Cincinnatians.... Were it not for the churches,... I think there might be a general bonfire of best bonnets, for I never could discover any other use for them.”
—Frances Trollope (1780–1863)