COMPSCI 171 Quiz: 04s-quiz-2-key
Document Summary
Ics 171 quiz #2 fifteen (15) minutes: (5 pts) name and email address: From right: (5 pts each, 30 pts total) use the following tree to indicate the order that nodes are expanded, for di erent types of search. Assume that g (double box) is the only goal node. Here, path costs are shown to the right of each path, g = cost of path so far, h = estimate of remaining cost to goal, f = estimate of total path cost. A g = 0 h = 100 f = 100. 80 g = 80 h = 30 f = 110. 5 g = 25 h = 55 f = 80. E g = 90 h = 20 f = 110. For each search strategy, write down the order in which nodes are expanded. The following is a proof that a* search (queue sorted by f ) is optimal if the heuristic is admiss- able.
