14 Jan 2004
CS 3243 - Blind Search
52
Properties of iterative deepening search
nComplete? Yes
nTime? (d+1)b0 + d b1 + (d-1)b2 + … + bd = O(bd)
nSpace? O(bd)
nOptimal? Yes, if step cost = 1