This preview shows page 1. Sign up to view the full content.
Unformatted text preview: n༆ Completeness:
q༇ Does it always find a solution if one exists?
NO
n༆ unless search space is finite and no loops are possible. DFS evaluation
n༆ Completeness: n༆ Time complexity: q༇ q༇ q༇ NO unless search space is finite.
Terrible if m (depth of search space) is much larger than d (depth
of optimal solution)
But if many solutions, then faster than BFS 9 9/20/13 DFS evaluation
n༆ Completeness:
q༇ n༆
n༆ Possible to use even less (expand one successor instead of all
b). Depthlimited search
n༆ DFS with depth limit l.
i.e., nodes at depth l have no successors.
q༇ Problem knowledge can be used for the depth limit.
Solves the infinitepath problem.
depthlimited_search (Fig 3.17) returns cutoff (not failure)
when it has reached the given depth without finding a
solution
If l < d (depth of least cost solution) then incomplete
If l > d then not optimal.
Time complexity: O(bl) Space complexity: O(bl)
q༇ n༆
n༆ n༆
n༆
n༆
n༆ ...
View
Full
Document
This note was uploaded on 02/10/2014 for the course CS 440 taught by Professor Staff during the Fall '08 term at Colorado State.
 Fall '08
 Staff
 Artificial Intelligence

Click to edit the document details