COMPSCI 171 Quiz: 2015-fq-cs-171-quiz-2-key
Document Summary
Perfect: ~97. 5% (~197 students), partial: ~1. 5% (~3 students), zero: ~1% (~2 students) Perfect: ~97. 5% (~197 students), partial: ~1% (~2 students), zero: ~x% (~3 students) Perfect: ~98% (~198 students), partial: ~0% (~0 students), zero: ~2% (~4 students) Perfect: ~68% (~137 students), partial: ~24. 5% (~50 students), zero: ~7. 5% (~15 students) Perfect: ~81. 5% (~165 students), partial: ~13% (~26 students), zero: ~5. 5% (~11 students) Quiz#2 fall quarter, 2015 20 minutes. Your id: (35 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 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) b. 9: (35 pts total, -5 for each error, but not negative) alpha-beta pruning. This is the same tree as above (1. a).
