Problem 4 Game Playing (10 points) – A B C Prob false false false 0.10 Apply the algorithm to the partial game tree mini-max false true 0.15 below, where it is the minimizer’s turn to play and the false true false 0.05 game does not involve randomness. The values estimated by false true true 0.11 the static-board evaluator (SBE) are indicated in the leaf true false false 0.09 nodes (higher scores are better for the maximizer). true false true 0.10 true true false 0.28 Write the estimated values of the intermediate nodes inside true true true 0.12 their circles and indicate the proper move of the minimizer by circling one of the root’s outgoing arcs. Process this game tree working left-to-right. List the first leaf node (if any) in the above game tree whose SBE score need not be computed: _________ the node whose score = Briefly explain why: Problem 5 Multiple-Choice and Short Answer Questions (25 points) – For each multiple-choice question, circle your answer. Unless stated otherwise, choose the one answer. You do not need to explain your answers except for best e. Genetic algorithms require be represented by data structures due to the fixed-sized ‘entities’ need to them. cross over TRUE FALSE
A B C Prob false false false 0.10 false true 0.15 false true false 0.05 false true true 0.11 true false false 0.09 true false true 0.10 true true false 0.28 true true true 0.12 Problem 4 – Game Playing (10 points) Apply the mini-max algorithm to the partial game tree below, where it is the minimizer’s turn to play and the game does not involve randomness. The values estimated by the static-board evaluator (SBE) are indicated in the leaf nodes (higher scores are better for the maximizer). Write the estimated values of the intermediate nodes inside their circles and indicate the proper move of the minimizer by circling one of the root’s outgoing arcs. Process this game tree working left-to-right. List the first leaf node (if any) in the above game tree whose SBE score need not be computed: the node whose score = _________ Briefly explain why: Problem 5 – Multiple-Choice and Short Answer Questions (25 points) For each multiple-choice question, circle your answer. Unless stated otherwise, choose the one best answer. You do not need to explain your answers except for e. Genetic algorithms require ‘entities’ be represented by fixed-sized data structures due to the need to cross over them. TRUE FALSE
midterm-fall16.docx