Question 2
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.
In the map, S is the first node to be refined, determine the next 3 nodes (from the 2nd to 4th node) refined by A*. Enter the nodes in the order they are refined. Enter a comma separated list of node labels. NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: X,Y,Z Answers Case Sensitive : No