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.
[edit] Literature ...
Depth-limited search
Depth-limited search avoids the pitfalls of depth-first search by imposing a cutoff on the maximum depth of a path.
Iterative deepening search ...
 See also: Depth-first search, Hill climbing, Dynamic programming, Search algorithm, Artificial intelligence
  
|
RSS
