Scribd
Upload
137 views18 pages

AI Uninformed Search Strategies by Examples

The document discusses various uninformed search strategies including breadth-first search, depth-first search, uniform cost search, depth-limited search, and iterative deepening search. It provides examples of how each strategy searches through a graph to find the goal node.

Uploaded by

reb20
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
137 views18 pages

AI Uninformed Search Strategies by Examples

The document discusses various uninformed search strategies including breadth-first search, depth-first search, uniform cost search, depth-limited search, and iterative deepening search. It provides examples of how each strategy searches through a graph to find the goal node.

Uploaded by

reb20
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 18

AI Uninformed Search

Strategies
Uninformed Search
• Uninformed Search strategies:-

1. Breadth-First Search (BFS)


2. Depth-First Search (DFS)
3. Uniform Cost Search (UCS)
4. Depth-Limited Search (DLS)
5. Iterative Deepening Search (IDS)
Breadth-First Search
Breadth-First Search Current Waiting
Goal - Node J A ---
A B, C
B C
B C, D
C D
C D, E, F
D E, F
D E, F, G, H
Breadth-First Search Current Waiting
Goal - Node J D E, F, G, H
E F, G, H
E F, G, H, I, J
F G, H, I, J
F G, H, I, J, K, L
G H, I, J, K, L
H I, J, K, L
I J, K, L
GOAL J K, L
Depth-First Search
Depth-First Search Current
Goal - Node J
A C
B E
D I
G E
D J
H
D
GOAL
B
A
Uniform Cost Search
Waiting
Uniform Cost Search Current
Ordered
Goal - Node G ---
,
𝑨𝟏 𝑮𝟏𝟐
𝑨𝟏 𝑪𝟐 , 𝑩𝟒 , 𝑮𝟏 𝟐
𝑪𝟐 𝑩 𝟒 , 𝑮 𝟏𝟐
𝑪𝟐 𝑫 𝟑 , 𝑩𝟒 , 𝑮𝟒 , 𝑮𝟏𝟐
𝑫𝟑 𝑩 𝟒 , 𝑮𝟒 , 𝑮𝟏𝟐
𝑫𝟑 𝑩𝟒 , 𝑮𝟒 , 𝑮𝟔 , 𝑮𝟏𝟐
Waiting
Uniform Cost Search Current
Ordered
Goal - Node G 𝑩𝟒 𝑮𝟒 , 𝑮𝟔 , 𝑮𝟏𝟐
𝑩𝟒 𝑮𝟒 , 𝑮𝟔 , 𝑫 𝟕 , 𝑮𝟏𝟐
𝑮𝟒 𝑮𝟔 , 𝑫 𝟕 , 𝑮𝟏𝟐

GOAL
Solve using BFS & DFS
Compare Costs
Depth-Limited Search
Depth-Limited Search Current
Depth – 2, Goal – Node J
A C
0
B E
1 D C
B F
A
2
Search Finished
3
NO GOAL
Iterative Deepening Search
Iterative Deepening Search Current
Depth – 0, Goal – Node J
A
0

2
Search Finished
3 NO GOAL
Increase Depth by 1
Iterative Deepening Search Current
Depth – 1, Goal – Node J
A C
0
B
1 A

2
Search Finished
3 NO GOAL
Increase Depth by 1
Iterative Deepening Search Current
Depth – 2, Goal – Node J
A C
0
B E
1 D C
B F
A
2
Search Finished
3 NO GOAL
Increase Depth by 1
Iterative Deepening Search Current
Depth – 3, Goal – Node J
A C
0
B E
1 D I
G E
D J
2 H
D
GOAL
3 B
A
Example 2

You might also like