For each of the following 2-dimensional pathfinding problems, state which algorithm you would use to find the shortest path as quickly as possible. Assume you are using the floor of the Euclidean distance as a heuristic estimate of the distance to the goal state. Give a short justification for your choice.
3
2
G
B
4
3
2
1
1
4
3
2
2
2
4
5
4
3
3
3
5
4
G
B
2
1
1
4
3
2
1
4
3
2
2
2
2
4
3
2 2 2
4
3
2
2
2
3
3
3
5
3
3
