14 Jan 2004
CS 3243 - Blind Search
44
Properties
of depth-first search
nComplete? No: fails in infinite-depth spaces, spaces with loops
nModify
to avoid repeated states along path
à complete in finite spaces
nTime? O(bm): terrible if m is much larger than d
n but if solutions are dense, may be much
faster than breadth-first
nSpace? O(bm), i.e., linear space!
nOptimal? No