2. Uninformed
Search
Uninformed search algorithms do not
have additional information about state
or search space other than how to
traverse the tree, so it is also called
blind search.
All they can do is generate successors and
distinguish a goal state from a non-goal
state
Example: Breadth-first search.
Depth-first search
Bidirectional Search
3. Breadth-first search
Breadth-first search is a simple strategy in
which the root node is expanded first, then all
the successors of the root node are expanded
next, then their successors, and so on.
This is achieved very simply by using a FIFO
queue data structure.
Level Search Technique.
Complete.
4. A
F
B C
E G
D
OMega TechEd
A
BC
CDE
DEFG
EFG
H
A B C D
FGH
GH
H
E F G H
Tail
Breadth-First Search
Head
5. Depth-first search
Depth first search (DFS) algorithm starts with
the initial node of the graph G, and then goes
to deeper and deeper until we find the goal
node or the node which has no children.
Depth-first search always expands the deepest
node in the current frontier of the search tree.
Depth-first search uses a LIFO .
Use data structure stack.
Incomplete
OMega TechEd
6. A
F
B C
E G
D
OMega TechEd
Depth-First Search
A
C
B
C
B
F
G
G
B
F
F
D
E
B E D
D
B
A
7. Bidirectional
search
The idea behind bidirectional
search is to run two
simultaneous searches, one
forward from the initial state and
the other backward from the
goal, hoping that the two
searches meet in the middle.
OMega TechEd
11. OMega TechEd
About the Channel
This channel helps you to prepare for BSc IT and BSc computer science subjects.
In this channel we will learn Business Intelligence ,Artificial Intelligence, Digital Electronics,
Internet OF Things Python programming , Data-Structure etc.
Which is useful for upcoming university exams.
Gmail: omega.teched@gmail.com
Social Media Handles:
omega.teched
megha_with
Subscribe