Question 1

ASK FOR PRINTED GRAPH SHEETS **Pages 1 to 8** **SEARCH**\ The figure shows a map on a uniform grid where each tile is 1x1 in size.\ The start node is S and the goal node is G.\ The MoveGen function returns nodes in alphabetical order.\ Use Manhattan Distance as the heuristic function.\ **Tie-breaker:** If several nodes have the same cost, use node labels to break the tie. Weighted graph on a unit grid with start S, goal G and nodes A–F with edge costs Based on the above data, answer the given subquestions. What is the path found by the Best First Search algorithm? Enter the path as a comma separated list of node labels.\ NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.\ **Answer format: S,X,Y,Z** **SEARCH**\ The figure shows a map on a uniform grid where each tile is 1x1 in size.\ The start node is S and the goal node is G.\ The MoveGen function returns nodes in alphabetical order.\ Use Manhattan Distance as the heuristic function.\ **Tie-breaker:** If several nodes have the same cost, use node labels to break the tie. Weighted graph on a unit grid with start S, goal G and nodes A–F with edge costs Based on the above data, answer the given subquestions. What is the path found by A\* search algorithm? Enter the path as a comma separated list of node labels.\ NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.\ **Answer format: S,X,Y,Z**