14 Jan 2004
CS 3243 - Blind Search
30
Properties
of breadth-first search
nComplete? Yes
(if b is finite)
nTime? 1+b+b2+b3+… +bd + b(bd-1) = O(bd+1)
nSpace? O(bd+1) (keeps every node in memory)
nOptimal? Yes (if cost = 1 per step)
nSpace is
the bigger problem (more than time)