L15 L16 FHEVAL L 20 L18 L21 1.6 L 19 L22 L23 All leaves in the above tree are goal nodes in a search task. For each node, n, the following table lists hi(n), a heuristic of the distance from node n to the nearest goal node. hi(n) | n | ht(n). hi(n) 3 3 18 20 21 13 14 15 22 23 1 1 82 16 The Heuristics h2(n), h3(n) are created according to the following formulas: hz(n) = h(n) + 1000 h (n) hz(n) = 1000 For example, h(2) = 3, h2 (2) = 1003, h3(2) = 0:003. Please answer the following questions: (1). Which goal node is found (first) by searching according to Depth First Search? (2). Which goal node is found (first) by searching according to Breadth First Search? (3). Which goal node is found (first) by searching according to Iterative Deepening? Specify the order in which the nodes are visited. Answer: (4). Which goal node is found (first) by searching according to Best First Search using h? _. Specify the order in which the nodes are visited. Answer: (5). Which goal node is found (first) by searching according to A# using h? Specify the order in which the nodes are visited. Answer: (6). Which goal node is found (first) by searching according to Best-First search using h2? L. You do not need to describe the order in which the nodes are visited. _. You do (7). Which goal node is found (first) by searching according to A* using h2?_ not need to describe the order in which the nodes are visited. (8). Which goal node is found (first) by searching according to Best-First search using h3? .You do not need to describe the order in which the nodes are visited. . You do (9). Which goal node is found (first) by searching according to A* using h3?__ not need to describe the order in which the nodes are visited. L15 L16 FHEVAL L 20 L18 L21 1.6 L 19 L22 L23 All leaves in the above tree are goal nodes in a search task. For each node, n, the following table lists hi(n), a heuristic of the distance from node n to the nearest goal node. hi(n) | n | ht(n). hi(n) 3 3 18 20 21 13 14 15 22 23 1 1 82 16 The Heuristics h2(n), h3(n) are created according to the following formulas: hz(n) = h(n) + 1000 h (n) hz(n) = 1000 For example, h(2) = 3, h2 (2) = 1003, h3(2) = 0:003. Please answer the following questions: (1). Which goal node is found (first) by searching according to Depth First Search? (2). Which goal node is found (first) by searching according to Breadth First Search? (3). Which goal node is found (first) by searching according to Iterative Deepening? Specify the order in which the nodes are visited. Answer: (4). Which goal node is found (first) by searching according to Best First Search using h? _. Specify the order in which the nodes are visited. Answer: (5). Which goal node is found (first) by searching according to A# using h? Specify the order in which the nodes are visited. Answer: (6). Which goal node is found (first) by searching according to Best-First search using h2? L. You do not need to describe the order in which the nodes are visited. _. You do (7). Which goal node is found (first) by searching according to A* using h2?_ not need to describe the order in which the nodes are visited. (8). Which goal node is found (first) by searching according to Best-First search using h3? .You do not need to describe the order in which the nodes are visited. . You do (9). Which goal node is found (first) by searching according to A* using h3?__ not need to describe the order in which the nodes are visited
