COMPSCI 171 Quiz: 2014-wq-cs-171-quiz-2-key
Document Summary
Quiz#2 winter quarter, 2014 20 minutes. Your id: id to right: row: seat: (15 pts total, -5 pts each error, but not negative) search properties. Fill in the values of the four evaluation criteria for each search strategy shown. Note: these assumptions are the same as in figure 3. 21 of your textbook. O(bm) more than 1, e. g. , o(b^d) vs. o(b^(d+1)). O(b^m) it differs from that shown below by no. Bidirectional (if applicable: (35 pts total, -5 pts for each error, but not negative) game trees. The game tree below illustrates a position reached in the game. At each leaf node is the estimated score returned by the heuristic static evaluator. Fill in each blank square with the proper mini-max search value. Cross out each leaf node that will be pruned by alpha-beta pruning. What is the best move for max? (write a, b, or c) c.
