Question: why bfs is not complete?
Answer: The algorithm is not complete since it does not find a solution in an infinite space, even though the solution is in depth d which is much lower than infinity. Imagine a strangely defined state space where each node has same number of successors as following number in Fibonacci sequence.