Question

Apply DFS to find the shortest path from S to one of the goals (G1 or G2) * S 8 4 5 C 4 D 5 A 12 1 10 B 4 G? 2 2 6 7 P 10 E 9 F 2 4 Goal State Start State 2 Heuristic estimate Step cost 16 8 0 4 2 H J G2 SADHJG2 SABCDHG1 none of above

          Apply DFS to find the shortest path
from S to one of the goals (G1 or G2) *
S
8
4
5
C
4
D
5
A
12
1
10
B
4
G?
2
2
6
7
P
10
E
9
F
2
4
Goal State
Start State
2 Heuristic estimate
Step cost
16
8
0
4
2
H
J
G2
SADHJG2
SABCDHG1
none of above

Apply DFS to find the shortest path
from S to one of the goals (G1 or G2) *
S
8
4
5
C
4
D
5
A
12
1
10
B
4
G?
2
2
6
7
P
10
E
9
F
2
4
Goal State
Start State
2 Heuristic estimate
Step cost
16
8
0
4
2
H
J
G2
SADHJG2
SABCDHG1
none of above

Added by Elizabeth T.

Computer Science and Information Technology

Trishna Knowledge Systems 2018 Edition

Instant Answer

Solved by Expert Akash M

Step 1

Start at the start state S. Show more…

Show all steps

Thanks for your feedback!

Apply DFS to find the shortest path from S to one of the goals (G1 or G2)* Goal State Start State Heuristic estimate Step cost SADHJG2 SABCDHG1 none of the above