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:
“The general will is always right.”
—Jean-Jacques Rousseau (1712–1778)
“There has always been the same amount of light in the world. The new and missing stars, the comets and eclipses, do not affect the general illumination, for only our glasses appreciate them.”
—Henry David Thoreau (1817–1862)
“Of what use, however, is a general certainty that an insect will not walk with his head hindmost, when what you need to know is the play of inward stimulus that sends him hither and thither in a network of possible paths?”
—George Eliot [Mary Ann (or Marian)