Find the best way shorteest path

icon
Related questions
Question
  1. Find the best way shorteest path
     
     
     
     
Greedy Search
111
97
H
118
80
101
Start
75
140
99
211
Goal
B
Heuristic: h(n)
366
374
329
244
253
178
193
98
0
State
A
B
C
D
E
F
G
H
I
f(n)= h (n) = straight-line distance heuristic
dist (A-E-G-H-I) = 140+80+97+101-418
Transcribed Image Text:Greedy Search 111 97 H 118 80 101 Start 75 140 99 211 Goal B Heuristic: h(n) 366 374 329 244 253 178 193 98 0 State A B C D E F G H I f(n)= h (n) = straight-line distance heuristic dist (A-E-G-H-I) = 140+80+97+101-418
Expert Solution
steps

Step by step

Solved in 3 steps with 1 images

Blurred answer
Similar questions
  • SEE MORE QUESTIONS