Consider the following figure below where each node is represented by uppercase and distance between each square is Apply A* algorithm to the graph below using Manhattan (City block) distance as heuristic function. [14 Marks] [CL02]

(A)Find the Manhattan (City block) distanc

(B)List the order in which the A* will explore the graph

(C)Show the path found by A* along with the cost

 

Transcribed Image Text:

10 23 33 10 33 23 24 37 35 22 29 22 H -22 K 21 64 33 Start 22 21 -23 21 33 33 M N 21 21 R 21 22 32 43 223 35 41 33 W Goal 10 23 33 10 33 23 24 37 35 22 29 22 H -22 K 21 64 33 Start 22 21 -23 21 33 33 M N 21 21 R 21 22 32 43 223 35 41 33 W Goal