Search Exercise

1
Search Exercise
Traffic Graph Start Node A Goal Node M

• Search Tree?
• Solution (Breadth First Search)?
• Solution (Depth First Search)?
• Solution (Iterative Deepening)?

2
Search Exercise (Continued)
3
Exercise Breadth-First
A
G
B
D
L
C
E
K
H
B
E
F
I
D
O
I
I
J
M

• Order of node expansion
• A, B, D, G, C, E, K, L, B, E, F, I, O, D, H, I,
  I, J, M
• Solution Found A ? D ? E ? I ? M (optimal)

4
Exercise Breadth-First(with duplicate detection)
A
G
B
D
L
C
E
K
F
I
O
H
J
M

• Order of node expansion
• A, B, D, G, C, E, K, L, F, I, O, H, J, M

5
Exercise Depth-First
A
G
B
D
C
E
B
E
F
I
M

• Order of node expansion A, B, D, C, B, E, I, M
• Solution Found A ? D ? C ? E ? I ? M (not
  optimal)

6
Exercise Iterative Deepening
1, 2, 6, 14, 29
A
5, 11, 23
G
B
D
4, 8, 16, 31
3, 7, 15, 30
9, 17, 32
L
C
E
K
H
B
E
F
I
D
O
I
I
J
M
Level 0 A Level 1 A, B, D, G Level 2 A, B, D,
C, E, G, K, L Level 3 A, B, D, C, B, E, F, E, I,
G, K, O, L, D, H Level 4 A, B, D, C, B, E, I, F,
I, J, E, I, M

• Order of node expansion