Ask a Question

will anyone please specify the answer of the iterative deepening??? I drew the full space tree while it was written to go in a BFS approach. Will any discredit will be given to me for this???

on 2011-12-09 23:45:05   by SUMIT   on Computer Science & Engineering  1 answers

sanchayita

on 2011-12-10 10:30:00  

Iterative deepening depth-first search (IDDFS) is a state space search strategy in which a depth-limited search is run repeatedly, increasing the depth limit with each iteration until it reaches d, the depth of the shallowest goal state. On each iteration, IDDFS 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, assuming no pruning, is effectively breadth-first.