Iterative Deepening Search IDSArtificial IntelligenceUnit–1Problem SolvingUninformed Searching

>> YOUR LINK HERE: ___ http://youtube.com/watch?v=Rt_zkpws4pQ

Unit – 1 – Problem Solving • Uninformed Searching Strategies - Iterative Deepening Search • The Iterative Deepening Depth First Search is simply called as iterative deepening search (IDS) • Combine the benefits of depth-first and breadth-first search to finds the best solution. • It gradually increase the limit from 0,1,2 and so on until reaches the goal. • It will terminate when the depth limit reaches d, depth of the shallowest goal node, with success message • May seem wasteful because states are generated multiple times • but actually not very costly, because nodes at the bottom level are generated only once • The overhead of these multiple expansions is small, because most of the nodes are towards leaves (bottom) of the search tree: • thus, the nodes that are evaluated several times (towards top of tree) are in relatively small number. • Iterative depending is the preferred uninformed search method when the search space is large and the depth of the solution is unknown • Performance measure of IDS • Combines the best of breadth-first and depth-first search strategies • Completeness: Yes • Time complexity: O(b d) • Space complexity: O( b d ) • Optimality: Yes, if step cost = 1 • Subscribe this channel, comment and share with your friends. • For Syllabus, Text Books, Materials and Previous University Question Papers and important questions • Follow me on • Blog : https://dsumathi.blogspot.com/ • Facebook Page : https://www.facebook.com/profile.php?... • Instagram : / dsumathiphd

#############################

New on site