For many problems, the maximum search depth is known in advance or the search is finite.
Check if the current vertex is within the maximum search depth
If not: Do nothing
If yes:
Expand the vertex and save all of its successors in a stack
Call DLS recursively for all vertices of the stack and go back to Step 2 ...
 See also: Search algorithm, Genetic algorithm, Reinforcement learning, Clustering, Knowledge representation
  
|
RSS
