Description
-
Given an n n grid where diagonal moves are not allowed, the start location, the destination, location of obstacles. Write a program that
-
(a)
Finds the optimal path from the source to the destination using BFS.
[30]
(b)
Finds the optimal path from the source to the destination using DFS.
[30]
(c)
If diagonal moves are allowed, uses A with Euclidean distance as heuristic to nd the
best path.
[40]
End of paper
