Question

Discuss the space and time complexity of iddfs given b: the branching factor

Answer 1

In computer science, iterative deepening search or more specificallyiterative deepening depth-first search[2](IDS or IDDFS) is a state space/graph search strategy in which a depth-limited version of depth-first search is run repeatedly with increasing depth limits until the goal is found. IDDFS is optimal like breadth-first search, but uses much less memory; at each iteration, it visits the nodes in the search tree in the same order as depth-first search, but the cumulative order in which nodes are first visited is effectively breadth-first.