📗 The quizzes must be completed during the lectures and submitted on TopHat: Link. No Canvas submissions are required. The grades will be updated by the end of the week on Canvas.
📗 Please submit a regrade request if (i) you missed a few questions because you are late or have to leave during the lecture; (ii) you selected obviously incorrect answers by mistake (one or two of these shouldn't affect your grade): Link
The following questions may appear as quiz questions during the lecture. If the questions are not generated correctly, try refresh the page using the button at the top left corner.
📗 [1 points] Two players, objects, you can pick 1 or 2 each time. Pick the last object to win. If you pick first, how many should you pick?
📗 Answer: .
📗 [4 points] Consider a zero-sum sequential move game with Chance. Max player moves first, then Chance, then Min. The values of the terminal states are shown in the diagram (they are the values for the Max player). What is the (expected) value of the game (for the Max player)?
📗 Answer: .
📗 [4 points] Highlight the nodes that will be alpha-beta pruned in the following game.
📗 [4 points] Consider the following zero-sum game tree. player moves first. Draw a new game tree by re-ordering the children of each internal node (including the root), such that the new game is equivalent to the tree above, but alpha-beta pruning will prune as many nodes as possible. (You do not have to submit the drawing.) Enter the number of nodes pruned.
📗 Note: in case the diagram is not clear, the values on the leafs (each sub-branch is a row): .
📗 Answer: .