COMPSCI 171 Quiz: 2018-ss1-cs-171-quiz-3-key
Document Summary
Cs-171, intro to a. i. , ss-1, 2018 quiz # 3 20 minutes. : seat no: (15 pts total, -5 pts for each error, but not negative) mini-max search in game trees. The game tree below illustrates a position reached in the game. At each leaf node (number at bottom) is the estimated score returned by the heuristic static evaluator. Fill in each blank square with the proper mini-max search value. What is the best move for max? (write a, b, or c) a. 9: (35 pts total, -5 for each error, but not negative) alpha-beta pruning. This is the same tree as above (1. a). You do not need to indicate the branch node values again. Draw x over each leaf node (number at bottom) that will be pruned by alpha-beta pruning. See section 5. 3. (max) (min) (max) (a) (b) (c) **** turn page over and continue on the other side **** 1: (25 pts total, 5 pts each) unifiers and unification.
