Consider the same maze shown above with the same start and goal nodes. Let the heuristic cost of every node to reach G be: Table of heuristic values hh(n) A 5.1 B 4.1 C 3.9 D 4 E 2.2

icon
Related questions
Question
Consider the same maze shown above with the same start and goal nodes. Let the heuristic cost of
every node to reach G be:
Table of
heuristic
values
hh(n)
A 5.1
B 4.1
C 3.9
D 4
E 2.2
F 3.8
GO
H 3.7
J 7
K 6
L 4
M 0.5
N 1.5
P 1.8
S 4.5
List the vertices expanded by a A* search (enter the single letter label of a node).
1. S
2. B
3.
4.
5.
6.
7.
8.
Transcribed Image Text:Consider the same maze shown above with the same start and goal nodes. Let the heuristic cost of every node to reach G be: Table of heuristic values hh(n) A 5.1 B 4.1 C 3.9 D 4 E 2.2 F 3.8 GO H 3.7 J 7 K 6 L 4 M 0.5 N 1.5 P 1.8 S 4.5 List the vertices expanded by a A* search (enter the single letter label of a node). 1. S 2. B 3. 4. 5. 6. 7. 8.
Consider navigating the maze shown below.
3.
4.
(z)
1. S
2. A
5.
N
L
M
G
B
F
H
6. D
7. P
2
8. G
2
4
C
E
P
2
2
2
A
S
The maze is represented as a graph with edge costs as shown on the edges. The edge cost is 1 for all
edges where the cost is not shown. Let S be the initial state and G be the goal state.
List the first 8 vertices expanded by Uniform Cost Search (enter the single letter label of a node).
B
FL
K
2
2
J
2
D
H
Transcribed Image Text:Consider navigating the maze shown below. 3. 4. (z) 1. S 2. A 5. N L M G B F H 6. D 7. P 2 8. G 2 4 C E P 2 2 2 A S The maze is represented as a graph with edge costs as shown on the edges. The edge cost is 1 for all edges where the cost is not shown. Let S be the initial state and G be the goal state. List the first 8 vertices expanded by Uniform Cost Search (enter the single letter label of a node). B FL K 2 2 J 2 D H
Expert Solution
steps

Step by step

Solved in 3 steps with 2 images

Blurred answer