Python( A* Algorithm)

Artificial intelligence

Question:

-:

Change the Heuristic Function of A* Algorithm to Euclidean distance.

The formula is given:

h(n) = sqrt((x₁ - x₂)² + (y₁ - y₂)²)

Implement a 8x8 Grid, choose the starting point to (0,0) and goal to (8,8) and find the total number of nodes the A* Algorithm visited.

-:

Dijkstra is a special case for A* (when the heuristics is zero). Implement the A* Algorithm, with no heuristic function.

Implement a 8x8 Grid, choose the starting point to (0,0) and goal to (8,8) and find the total number of nodes the A* Algorithm visited.

Note:

do display the output of a running program

add comments for better understanding of solution