Question 1: Consider the following search tree, where the values on the links represent the step costs between states and their successors. a) If the goal is represented by the nodes H and I (i.e., the goal can be reached through two path: A,C,H and A,D,I), show how the Breadth-First Search algorithm works for reaching to the goal using fringe sets. 8 K E 10 6 L B A B C D 20 13 20 12 6 M F E 6 7 F 5 N 10 4 4 G H I X 18 22 17 18 10 P 5 C 6 12 W H V 8 R Z Is it optimal in this case? Justify your answer. b) Consider the heuristic values in the table; apply RBFS (the heuristic value of the goal equals to 0). Heuristic values K L M N O 0 4 4 0 9 4 S T P W R 8 D 8 S T U 14 17 25 16 13 U V 22 Z 21
Question 1: Consider the following search tree, where the values on the links represent the step costs between states and their successors. a) If the goal is represented by the nodes H and I (i.e., the goal can be reached through two path: A,C,H and A,D,I), show how the Breadth-First Search algorithm works for reaching to the goal using fringe sets. 8 K E 10 6 L B A B C D 20 13 20 12 6 M F E 6 7 F 5 N 10 4 4 G H I X 18 22 17 18 10 P 5 C 6 12 W H V 8 R Z Is it optimal in this case? Justify your answer. b) Consider the heuristic values in the table; apply RBFS (the heuristic value of the goal equals to 0). Heuristic values K L M N O 0 4 4 0 9 4 S T P W R 8 D 8 S T U 14 17 25 16 13 U V 22 Z 21
Related questions
Question
Transcribed Image Text:Question 1: Consider the following search tree, where the values on the links represent the step costs between
states and their successors.
a) If the goal is represented by the nodes H and I (i.e., the goal can be reached through two path: A,C,H and
A,D,I), show how the Breadth-First Search algorithm works for reaching to the goal using fringe sets.
8
A
20
K
E
10
6
L
B
6
7
M
F
7
N
10
4
10
X
18
P
6
12
W
H
1
V
8
R
9
4
Z
4
6
T
Is it optimal in this case? Justify your answer.
b) Consider the heuristic values in the table; apply RBFS (the heuristic value of the goal equals to 0).
B C D
13 20 12
E
6
F G H I
18 22 17
Heuristic values
K L M NO P W R
0 4 4 0 9 8 17 25
5
c) Let b=2, d=3 and m=6, what is the total number of generated nodes by BFS?
D
8
S T U
16 13 14
X
3
U
V Z
22
21
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps with 4 images
