Lab Assignment $3$

This assignment will use the $A^{**}$ search algorithm to find the best path between the start and goal

nodes. This assignment will be done in two parts,

Part $1$: Take a portion of a map of Makkah$($City in saudi Arabia$)$ and built the data as nodes of all the roads. Calculate the

actual distances between the nodes. Also, use a heuristic function to find the heuristic distances

between all the nodes.

Part $2$: Once the data is ready, make a program that inputs the start and goal nodes and finds the

shortest path between the start node and the goal node using the $A^{**}$ search algorithm.

Submit one pdf file only on blackboard.

Submission:

$($i$)$ Working code

$($ii$)$ Description of the data and working of code

Note: write the code in python, provide the complete code in the answer with test cases and how can i add a new neighborhood