Question 1

ASK FOR PRINTED GRAPH SHEETS **10 PAGES** **DOUBLE-SIDED** **SEARCH** Map on a unit grid with nodes A to F, start S and goal G, with instructions on MoveGen order, Manhattan distance heuristic and tie-breaker 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** Map on a unit grid with nodes A to F, start S and goal G, with instructions on MoveGen order, Manhattan distance heuristic and tie-breaker 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**