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, the depth of the shallowest goal state. IDDFS is equivalent to breadth-first search, but uses much less memory; on 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.
Read more about Iterative Deepening Depth-first Search: Properties, Example, Algorithm, Related Algorithms
Famous quotes containing the words deepening and/or search:
“And Death fell with me, like a deepening moan.
And He, picking a manner of worm, which half had hid
Its bruises in the earth, but crawled no further,
Showed me its feet, the feet of many men,
And the fresh-severed head of it, my head.”
—Wilfred Owen (1893–1918)
“When you start with a portrait and search for a pure form, a clear volume, through successive eliminations, you arrive inevitably at the egg. Likewise, starting with the egg and following the same process in reverse, one finishes with the portrait.”
—Pablo Picasso (1881–1973)