Artificial Intelligence question: To compare the difference between the depth-fi

Question

• To compare the difference between the depth-first search and the iterative deepening search, we can imagine a program domain where each state has a single successor, and there is a single goal at depth n. How many steps requires the depth-first search to find the goal? How many steps requires the iterative deepening search? Any difference?

• To compare the difference between the depth-first search and the iterative deepening search, we can imagine a program domain where each state has a single successor, and there is a single goal at depth n. How many steps requires the depth-first search to find the goal? How many steps requires the iterative deepening search? Any difference?

• To compare the difference between the depth-first search and the iterative deepening search, we can imagine a program domain where each state has a single successor, and there is a single goal at depth n. How many steps requires the depth-first search to find the goal? How many steps requires the iterative deepening search? Any difference?

Explanation / Answer

Basically in DFS from some node in the graph you explore deeper and deeper while you can find new nodes that you have not reached yet. When DFS runs out of moves, it basically backtracks to the latest point where it could find a different choice, then explores that choice.If there is a single solution For large graphs it can be a problem as you have to explore the entire graph .

Where as Iterative deepening keep increasing the depth at each level. (means it exploring using all paths of length one, then two, then three, etc.) until we have end up by finding the node in question. This means it does not exploring along infinite dead-end paths. With Iterative deepening we always find shortest possible path to the destination node.

Conclusion,Basically depth-first search keeps going deeper and deeper.where as in iterative deepening you have to establish a value of a level, if there is no solution at that level, you increment that value, and start again from scratch

·         Iterative deepening basically provide DFS is not guaranteed to find an optimal path which was not guaranteed by DFS .

·         Iterative deepening only explore the entire graph if the distance between the start node and end node is the maximum in the graph where as DFS may explore the entire graph to find the target node;

Basically in DFS from some node in the graph you explore deeper and deeper while you can find new nodes that you have not reached yet. When DFS runs out of moves, it basically backtracks to the latest point where it could find a different choice, then explores that choice.If there is a single solution For large graphs it can be a problem as you have to explore the entire graph .

Where as Iterative deepening keep increasing the depth at each level. (means it exploring using all paths of length one, then two, then three, etc.) until we have end up by finding the node in question. This means it does not exploring along infinite dead-end paths. With Iterative deepening we always find shortest possible path to the destination node.

Related Questions

Navigate

• Browse (All)
• Browse A
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.