Depth First Search-DFS-Artificial Intelligence-Unit-1-Problem Solving-Uninformed Searching

Unit - 1 - Problem Solving
Uninformed Searching Strategies-Depth First Search
Start with the root node and completely explore the left most child nodes, before exploring its siblings
Siblings are explored in a left- to-right fashion.
Depth-first search always expands the deepest node in the current frontier of the search tree
Depth-first traversal: 1 → 2 → 4 → 5 → 3 → 6 → 7
Expanded node Nodes list
{ S0 }
S0 { A3 B1 C8 }
A3 { D6 E10 G18 B1 C8 }
D6 { E10 G18 B1 C8 }
E10 { G18 B1 C8 }
G18 { B1 C8 }
Solution path found is S A G, cost 18
Number of nodes expanded (including goal node) = 5
Complete: Yes
Time : O(bm)
Space: O(bm)
Optimal: No
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 : dsumathi.blogspot.com/
Facebook Page : profile.php?...
Instagram : / dsumathiphd

[@senthilkumarsadhasivam6984]

Good class work, well presented, neet diagrams simply intelligent

[@WinningCSE]

So nice of you