Iterative deepening search - HiIAmTzeKean/SC3000-Artificial-Intelligence GitHub Wiki
tags:
- 🌱
- AI
- ComputerScience
- Search date: 18--Apr--2023
Rerun Depth limited search for an increasing depth limit.
- Complete
- A solution must be found since the search is done at each layer
- Optimal
- Yes, similar to Breadth first search but use of Depth first search to search each later
- Time
- Worse case explore entire tree
$O(b^d)$
- Space
- Only need to store frontier nodes similar to Depth first search
$O(bd)$
Links: