Question 6
SEARCH The figure shows a map on a grid where each tile is 1x1 in size. All locations are at grid points. The start node is S, and the goal node is G. MoveGen returns neighbours in alphabetical order. Use Manhattan distance as the heuristic function. Tie-breaker: Use alphabetical order to break ties.
Emulate A*, WA* (w=2) and Branch-and-Bound on the given map, then answer the sub-questions.
For the given map, which algorithms find a path that is also an optimal path?
A*
Branch and Bound
Breadth First Search
Hill Climbing
WA* (w=2)