Iterative Deepening Search (IDS) combines the space efficiency and optimality of Breadth-First Search(BFS) when all step costs are equal. Instead of diving deep immediately like Depth-First Search (DFS), IDS repeatedly runs a Depth-Limited Search (DLS) with increasing depth limit until the goal is found.
- Completeness: Yes, as BFS
- Optimality: Yes, as BFS
Depth-Limited Search (DLS)
Depth-Limited Search (DLS) is a modified version of DFS.