Consider a finite, acyclic search space where depth$-$first search is guaranteed to eventually find a

solution and the root is not a goal. In this situation iterative deepening search will always explore more

nodes than depth$-$first.