CS 370D L Maram ALShablan 1 Uninformed Search Algorithms examples Princess Noura bint Abdulrahman University College of Computer and Information Sciences L Maram ALShablan ID: 713495
Download Presentation The PPT/PDF document "Artificial Intelligence" is the property of its rightful owner. Permission is granted to download and print the materials on this web site for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.
Slide1
Artificial Intelligence (CS 370D)
L. Maram ALShablan
1
Uninformed Search Algorithms ( examples)
Princess
Noura
bint
Abdulrahman University
College of Computer and Information SciencesSlide2
L. Maram ALShablan
2
Breadth First SearchSlide3
Breadth First SearchL. Maram ALShablan
3
Given
the following state space (tree search), traverse this tree to find node O and give the sequence of visited nodes when using BFS.A
B
C
E
D
F
G
H
I
J
K
L
O
M
NSlide4
L. Maram ALShablan
4
Breadth First Search
A,A
B
C
E
DSlide5
Breadth First SearchL. Maram ALShablan
5
A
, BA
B
C
E
D
F
GSlide6
Breadth First SearchL. Maram ALShablan
6
A, B,C
A
B
C
E
D
F
G
HSlide7
Breadth First SearchL. Maram ALShablan
7
A,B,C,D
A
B
C
E
D
F
G
H
I
JSlide8
Breadth First SearchL. Maram ALShablan
8
A,B,C,D,E
A
B
C
E
D
F
G
H
I
JSlide9
Breadth First SearchL. Maram ALShablan
9
A,B,C,D,E,F
,A
B
C
E
D
F
G
H
I
JSlide10
Breadth First SearchL. Maram ALShablan
10
A,B,C,D,E,F,G
A
B
C
E
D
F
G
H
I
J
K
LSlide11
Breadth First SearchL. Maram ALShablan
11
A,B,C,D,E,F,G,H
A
B
C
E
D
F
G
H
I
J
K
LSlide12
Breadth First SearchL. Maram ALShablan
12
A,B,C,D,E,F,G,H,I
A
B
C
E
D
F
G
H
I
J
K
L
MSlide13
Breadth First SearchL. Maram ALShablan
13
A,B,C,D,E,F,G,H,I,J
,A
B
C
E
D
F
G
H
I
J
K
L
M
NSlide14
Breadth First SearchL. Maram ALShablan
14
A,B,C,D,E,F,G,H,I,J,K
,A
B
C
E
D
F
G
H
I
J
K
L
M
NSlide15
Breadth First SearchL. Maram ALShablan
15
A,B,C,D,E,F,G,H,I,J,K,L
A
B
C
E
D
F
G
H
I
J
K
L
O
M
NSlide16
Breadth First SearchL. Maram ALShablan
16
A,B,C,D,E,F,G,H,I,J,K,L,M
,A
B
C
E
D
F
G
H
I
J
K
L
O
M
NSlide17
Breadth First SearchL. Maram ALShablan
17
A,B,C,D,E,F,G,H,I,J,K,L,M,N
,A
B
C
E
D
F
G
H
I
J
K
L
O
M
NSlide18
Breadth First SearchL. Maram ALShablan
18
A,B,C,D,E,F,G,H,I,J,K,L,M,N,
OA
B
C
E
D
F
G
H
I
J
K
L
O
M
NSlide19
Breadth First SearchL. Maram ALShablan
19
A
B
C
E
D
F
G
H
I
J
K
L
O
M
N
Answer:
The
sequence of visited
nodes:
A,B,C,D,E,F,G,H,I,J,K,L,M,N
,
O
Success Slide20
Depth First SearchDFS
L. Maram ALShablan
20Slide21
Depth First Search (DFS)L. Maram ALShablan
21
Given
the following state space (tree search), traverse this tree to find node O and give the sequence of visited nodes when using DFS.A
B
C
E
D
F
G
H
I
J
K
L
O
M
NSlide22
Depth First SearchL. Maram ALShablan
22
A,
A
B
C
E
DSlide23
Depth First SearchL. Maram ALShablan
23
A,B,
A
B
C
E
D
F
GSlide24
Depth First SearchL. Maram ALShablan
24
A,B,F,
A
B
C
E
D
F
GSlide25
Depth First SearchL. Maram ALShablan
25
A,B,F,
B,G,A
B
C
E
D
F
G
K
LSlide26
Depth First SearchL. Maram ALShablan
26
A,B,F,
B,G,K,A
B
C
E
D
F
G
K
LSlide27
Depth First SearchL. Maram ALShablan
27
A,B,F,
B,G,K,G,L,A
B
C
E
D
F
G
K
L
OSlide28
Depth First SearchL. Maram ALShablan
28
A,B,F,
B,G,K,G,L, O: Goal StateA
B
C
E
D
F
G
K
L
OSlide29
Depth First SearchL. Maram ALShablan
29
Answer:
The sequence of visited nodes: A,B,F,B, G,K, G,L, OSuccess
A
B
C
E
D
F
G
K
L
OSlide30
Depth-Limited SearchDLS
L. Maram ALShablan
30Slide31
Depth-Limited Search (DLS)L. Maram ALShablan
31
Given the following state space (tree search), traverse this tree to find
node O and give the sequence of visited nodes when using DLS (Limit = 2)A
B
C
E
D
F
G
H
I
J
K
L
O
M
N
Limit = 0
Limit = 1
Limit = 2Slide32
Depth-Limited Search (DLS)L. Maram ALShablan
32
A,
A
B
C
E
D
Limit = 2Slide33
Depth-Limited Search (DLS)L. Maram ALShablan
33
A,B,
A
B
C
E
D
F
G
Limit = 2Slide34
Depth-Limited Search (DLS)L. Maram ALShablan
34
A,B,F
cutoffA
B
C
E
D
F
G
Limit = 2Slide35
Depth-Limited Search (DLS)L. Maram ALShablan
35
A,B,F
cutoff B,G, cutoff A
B
C
E
D
F
G
Limit = 2Slide36
Depth-Limited Search (DLS)L. Maram ALShablan
36
A,B,F
cutoff B,G, cutoff A
B
C
E
D
F
G
H
Limit = 2Slide37
Depth-Limited Search (DLS)L. Maram ALShablan
37
A,B,F
cutoff B,G, cutoff B, A, C, H cutoff
A
B
C
E
D
F
G
H
Limit = 2Slide38
Depth-Limited Search (DLS)L. Maram ALShablan
38
A
B
C
E
D
F
G
H
I
J
Limit = 2
A,B,F
cutoff
B,G,
cutoff
B, A, C, H
cutoff
Slide39
Depth-Limited Search (DLS)L. Maram ALShablan
39
A
B
C
E
D
F
G
H
I
J
Limit = 2
A,B,F
cutoff
B,G,
cutoff
B, A, C, H
cutoff
C,A,D,I
cutoffSlide40
Depth-Limited Search (DLS)L. Maram ALShablan
40
A
B
C
E
D
F
G
H
I
J
Limit = 2
A,B,F
cutoff
B,G,
cutoff
B, A, C, H
cutoff
C,A,D,I
cutoff
D,J
cutoffSlide41
Depth-Limited Search (DLS)L. Maram ALShablan
41
A
B
C
E
D
F
G
H
I
J
Limit = 2Slide42
Depth-Limited Search (DLS)L. Maram ALShablan
42
A
B
C
E
D
F
G
H
I
J
Limit = 2
A,B,F
cutoff
B,G,
cutoff
B, A, C, H
cutoff
C,A,D,I
cutoff
D,J
cutoff
D,A,E
FailureSlide43
Depth-Limited Search (DLS)L. Maram ALShablan
43
Answer:
Failure (no solution)Because the goal is beyond the limit 2 (the goal depth is 4)
A
B
C
E
D
F
G
H
I
J
K
L
O
M
N
Limit = 2Slide44
Iterative Deepening SearchIDS
L. Maram ALShablan
44Slide45
Iterative Deepening Search (IDS)L. Maram ALShablan
45
Given the following state space (tree search), traverse this tree to find
node O and give the sequence of visited nodes when using IDS till limit 4A
B
C
E
D
F
G
H
I
J
K
L
O
M
N
Limit = 0
Limit = 1
Limit = 2
Limit = 3
Limit = 4Slide46
L. Maram ALShablan46
A
Limit = 0Slide47
L. Maram ALShablan47
A
Limit = 0
Iteration#
Answer0
A,
FailureSlide48
L. Maram ALShablan48
A
B
C
E
D
Limit = 1Slide49
L. Maram ALShablan49
A
B
C
E
D
Limit = 1
Iteration#
Answer
0
A,
Failure
1
A, B
cutoffSlide50
L. Maram ALShablan50
A
B
C
E
D
Limit = 1
Iteration#
Answer
0
A,
Failure
1
A, B
cutoff
A, C
cutoffSlide51
L. Maram ALShablan51
A
B
C
E
D
Limit = 1
Iteration#
Answer
0
A,
Failure
1
A, B
cutoff
A, C
cutoff
A,D
cutoffSlide52
L. Maram ALShablan52
A
B
C
E
D
Limit = 1
Iteration#
Answer
0
A,
Failure
1
A, B
cutoff
A, C
cutoff
A,D
cutoff
A, E
failure Slide53
L. Maram ALShablan53
A
B
C
E
D
Limit = 1Slide54
L. Maram ALShablan54
A
B
C
E
D
Limit = 2
Iteration#
Answer
0
A,
Failure
1
A, B
cutoff
A, C
cutoff
A,D
cutoff
A, E
failure
2Slide55
L. Maram ALShablan55
A
B
C
E
D
F
G
Limit = 2
Iteration#
Answer
0
A,
Failure
1
A, B
cutoff
A, C
cutoff
A,D
cutoff
A, E
failure
2Slide56
L. Maram ALShablan56
A
B
C
E
D
F
G
Limit = 2
Iteration#
Answer
0
A,
Failure
1
A, B
cutoff
A, C
cutoff
A,D
cutoff
A, E
failure
2
A, B,F
cutoffSlide57
L. Maram ALShablan57
A
B
C
E
D
F
G
Limit = 2
Iteration#
Answer
0
A,
Failure
1
A, B
cutoff
A, C
cutoff
A,D
cutoff
A, E
failure
2
A, B,F
cutoff
B, G
cutoff Slide58
L. Maram ALShablan58
A
B
C
E
D
F
G
H
Limit = 2
Iteration#
Answer
0
A,
Failure
1
A, B
cutoff
A, C
cutoff
A,D
cutoff
A, E
failure
2
A, B,F
cutoff
B, G
cutoff Slide59
L. Maram ALShablan59
A
B
C
E
D
F
G
H
Limit = 2
Iteration#
Answer
0
A,
Failure
1
A, B
cutoff
A, C
cutoff
A,D
cutoff
A, E
failure
2
A, B,F
cutoff
B, G
cutoff
B, A, C, H
cutoff Slide60
L. Maram ALShablan60
A
B
C
E
D
F
G
H
I
J
Limit = 2
Iteration#
Answer
0
A,
Failure
1
A, B
cutoff
A, C
cutoff
A,D
cutoff
A, E
failure
2
A, B,F
cutoff
B, G
cutoff
B, A, C, H
cutoff Slide61
L. Maram ALShablan61
A
B
C
E
D
F
G
H
I
J
Limit = 2
Iteration#
Answer
0
A,
Failure
1
A, B
cutoff
A, C
cutoff
A,D
cutoff
A, E
failure
2
A, B,F
cutoff
B, G
cutoff
B, A, C, H
cutoff
C,A,D,I
cutoffSlide62
L. Maram ALShablan62
A
B
C
E
D
F
G
H
I
J
Limit = 2
Iteration#
Answer
0
A,
Failure
1
A, B
cutoff
A, C
cutoff
A,D
cutoff
A, E
failure
2
A, B,F
cutoff
B, G
cutoff
B, A, C, H
cutoff
C,A,D,I
cutoff
D, J
cutoff Slide63
L. Maram ALShablan63
A
B
C
E
D
F
G
H
I
J
Limit = 2
Iteration#
Answer
0
A,
Failure
1
A, B
cutoff
A, C
cutoff
A,D
cutoff
A, E
failure
2
A, B,F
cutoff
B, G
cutoff
B, A, C, H
cutoff
C,A,D,I
cutoff
D, J
cutoff
D,A,E
failure Slide64
L. Maram ALShablan64
A
B
C
E
D
F
G
H
I
J
K
L
O
M
N
Limit = 2
Iteration#
Answer
0
A,
Failure
1
A, B
cutoff
A, C
cutoff
A,D
cutoff
A, E
failure
2
A, B,F
cutoff
B, G
cutoff
B, A, C, H
cutoff
C,A,D,I
cutoff
D, J
cutoff
D,A,E
failure Slide65
L. Maram ALShablan65
A
B
C
E
D
Limit = 3
Iteration#
Answer
0
A,
Failure
1
A, B
cutoff
A, C
cutoff
A,D
cutoff
A, E
failure
2
A, B,F
cutoff
B, G
cutoff
B, A, C, H
cutoff
C,A,D,I
cutoff
D, J
cutoff
D,A,E
failure
3Slide66
L. Maram ALShablan66
A
B
C
E
D
F
G
Limit = 3Slide67
L. Maram ALShablan67
A
B
C
E
D
F
G
Limit = 3Slide68
L. Maram ALShablan68
A
B
C
E
D
F
G
K
L
Limit = 3Slide69
L. Maram ALShablan69
A
B
C
E
D
F
G
K
L
Limit = 3Slide70
L. Maram ALShablan70
A
B
C
E
D
F
G
K
L
Limit = 3
Iteration#
Answer
3
A,B,F
B,G,K
cutoff
G,L
cutoff Slide71
L. Maram ALShablan71
A
B
C
E
D
F
G
H
K
L
Limit = 3Slide72
L. Maram ALShablan72
A
B
C
E
D
F
G
H
K
L
Limit = 3
Iteration#
Answer
3
A,B,F
cutoff
B,G,K
cutoff
G,L
cutoff
G,B,A,C,H
cutoff Slide73
L. Maram ALShablan73
A
B
C
E
D
F
G
H
I
J
K
L
Limit = 3Slide74
L. Maram ALShablan74
A
B
C
E
D
F
G
H
I
J
K
L
M
Limit = 3Slide75
L. Maram ALShablan75
A
B
C
E
D
F
G
H
I
J
K
L
M
Limit = 3
Iteration#
Answer
3
A,B,F
cutoff
B,G,K
cutoff
G,L
cutoff
G,B,A,C,H
cutoff
C,A,D,I,M
cutoff Slide76
L. Maram ALShablan76
A
B
C
E
D
F
G
H
I
J
K
L
M
N
Limit = 3Slide77
L. Maram ALShablan77
A
B
C
E
D
F
G
H
I
J
K
L
M
N
Limit = 3
Iteration#
Answer
3
A,B,F
cutoff
B,G,K
cutoff
G,L
cutoff
G,B,A,C,H
cutoff
C,A,D,I,M
cutoff
I,D,J,N
cutoffSlide78
L. Maram ALShablan78
A
B
C
E
D
F
G
H
I
J
K
L
M
N
Limit = 3Slide79
L. Maram ALShablan79
A
B
C
E
D
F
G
H
I
J
K
L
O
M
N
Limit = 3
Iteration#
Answer
3
A,B,F
cutoff
B,G,K
cutoff
G,L
cutoff
G,B,A,C,H
cutoff
C,A,D,I,M
cutoff
I,D,J,N
cutoff
J,D,A,E
failure Slide80
L. Maram ALShablan80
A
B
C
E
D
Limit = 4
Iteration#
Answer
3
A,B,F
cutoff
B,G,K
cutoff
G,L
cutoff
G,B,A,C,H
cutoff
C,A,D,I,M
cutoff
I,D,J,N
cutoff
J,D,A,E
failure
4Slide81
L. Maram ALShablan81
A
B
C
E
D
F
G
Limit = 4Slide82
L. Maram ALShablan82
A
B
C
E
D
F
G
Limit = 4
Iteration#
Answer
4
A,B,F
cutoffSlide83
L. Maram ALShablan83
A
B
C
E
D
F
G
K
L
Limit = 4Slide84
L. Maram ALShablan84
A
B
C
E
D
F
G
K
L
Limit = 4
Iteration#
Answer
4
A,B,F
cutoff
B,G,K
cutoffSlide85
L. Maram ALShablan85
A
B
C
E
D
F
G
K
L
O
Limit = 4
Iteration#
Answer
4
A,B,F
cutoff
B,G,K
cutoffSlide86
L. Maram ALShablan86
A
B
C
E
D
F
G
K
L
O
Limit = 4
Iteration#
Answer
4
A,B,F
cutoff
B,G,K
cutoff
G,L,O
SuccessSlide87
Iterative Deepening Search (IDS)L. Maram ALShablan
87
Iteration#
Answer0A, Failure1A, B cutoff
A, C cutoff
A,D
cutoff
A, E
failure
2
A, B,F
cutoff
B, G
cutoff
B, A, C, H
cutoff
C,A,D,I
cutoff
D, J
cutoff
D,A,E
failure
3
A,B,F
cutoff
B,G,K
cutoff
G,L
cutoff
G,B,A,C,H
cutoff
C,A,D,I,M
cutoff I,D,J,N
cutoff J,D,A,E
failure
4
A,B,F
cutoff
B,G,K cutoff
G,L,O Success
Answer:Slide88
Uniform Cost SearchUCS
L. Maram ALShablan
88Slide89
L. Maram ALShablan89
Consider the search space of Figure 1, where state
a
is the initial state and G is the goal state. Assume that the actions are ordered according to their resulting state alphabetically. For example the action (a; b) comes before (a; c).
Uniform Cost Search (UCS)Slide90
L. Maram ALShablan90Slide91
L. Maram ALShablan91
The final explored
list: a-d-c-f-b-e-G
The final frontier list: empty. The solution found: (a,d,c,b,e,G). The cost of the solution: 6.