CSCI 4511W Midterm: CS 4511 UMN Midterm 1 03
Document Summary
75 minutes == 75 points open book and notes: 15 points. You are given the following graph, where each node has an identi er (a letter) and an h value. A number along an arc indicates the cost of the arc. G h=0: show in what order a* expands nodes from start to g. g is the goal node. For each node expanded during the search show its f and g values. Turn to the next page for more questions: 15 points. Suppose you have two admissible heuristics, h1 and h2. You decide to create the following new heuristic functions de ned as follows: h3(n) = max(h1(n), h2(n)) h4(n) = max(h1(n), 1. 1 h2(n)) h5(n) = min(h1(n), 3 h2(n)) h6(n) = h1(n) + h2(n) For each of the new heuristics specify of it is admissible or not. Would you use any of these heuristics instead of using h1 or h2: 15 points.
