n
Complete?
Yes
n
Time?
(d+1)b
0
+ d b
1
+ (d-1)b
2
+ … + b
d
=
O(b
d
)
n
Space?
O(bd)
n
Optimal?
Yes, if step cost = 1
