Depth-first iterative-deepening: An opti
✍
Richard E. Korf
📂
Article
📅
1985
🏛
Elsevier Science
🌐
English
⚖ 686 KB
The complexities of various search algorithms are considered in terms of time, space, and cost of solution path. It is known that breadth-first search requires too much space and depth-first search can use too much time and doesn't always find a cheapest path. A depth-first iterative-deepening algor