7. Breadth-First Search
Expanded node Nodes list
{ S0 }
S0 { A1 B5 C15 }
A1 {B5 C15 G11 }
B5 {C15 G11 G10 }
C15 {G11 G10 G20 }
S
C
B
A
G
1 5 15
10
5
5
8. Breadth-First Search
Expanded node Nodes list
{ S0 }
S0 { A1 B5 C15 }
A1 {B5 C15 G11 }
B5 {C15 G11 G10 }
C15 {G11 G10 G20 }
G11 {G10 G20 }
S
C
B
A
G
1 5 15
10
5
5
9. Breadth-First Search
Expanded node Nodes list
{ S0 }
S0 { A1 B5 C15 }
A1 {B5 C15 G11 }
B5 {C15 G11 G10 }
C15 {G11 G10 G20 }
G11 {G10 G20 }
Solution path found is S A G , cost 11
Number of nodes expanded (including goal node) = 5
S
C
B
A
G
1 5 15
10
5
5
13. Depth-First Search
Expanded node Nodes list
{ S0 }
S0 {A1 B5 C15 }
A1 {G11 B5 C15}
G11 {B5 C15}
Solution path found is S A G, cost 11
Number of nodes expanded (including goal node) = 3
S
C
B
A
G
1 5 15
10
5
5
17. Uniform-Cost Search
Expanded node Nodes list
{ S0 }
S0 { A1 B5 C15 }
A1 {B5 G11C15 }
B5 {G10G11C15 }
G10 {G10 C15 }
S
C
B
A
G
1
5 15
10
5
5
18. Uniform-Cost Search
Expanded node Nodes list
{ S0 }
S0 { A1 B5 C15 }
A1 {B5 G11C15 }
B5 {G10G11C15 }
G10 {G10 C15 }
Solution path found is S B G, cost 10
Number of nodes expanded (including goal node) = 4
S
C
B
A
G
1
5 15
10
5
5
19. How they perform
• Breadth-First Search:
– Expanded nodes: S A B C G
– Solution found: S A G (cost 11)
• Depth-First Search:
– Expanded nodes: S A G
– Solution found: S A G (cost 11)
• Uniform-Cost Search:
– Expanded nodes: S A B G
– Solution found: S B G (cost 10)