what is the difference between iterative deepening search & depth limited search?
DFS is not guaranteed to find an optimal path; iterative deepening is. DFS may explore the entire graph before finding the target node; iterative deepening only does this if the distance between the start and end node is the maximum in the graph. ... BFS uses O(bd) memory, while iterative deepening uses only O(d).