📗 Enter your ID (the wisc email ID without @wisc.edu) here: and click (or hit enter key) 1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25m28
📗 If the questions are not generated correctly, try refresh the page using the button at the top left corner.
📗 The same ID should generate the same set of questions. Your answers are not saved when you close the browser. You could print the page: , solve the problems, then enter all your answers at the end.
📗 Please do not refresh the page: your answers will not be saved.
📗 [3 points] Which nodes are pruned by alpha-beta pruning? The player moves first.
📗 Select the nodes:
select
📗 Note: please do not select any edges.
📗 [3 points] Which nodes are pruned by alpha-beta pruning? The player moves first.
📗 Select the nodes:
select
📗 Note: please do not select any edges.
📗 [4 points] Highlight the nodes that will be alpha-beta pruned in the following game.
📗 [4 points] Enter the smallest integer value of \(A\) such that \(B\) will be alpha-beta pruned? Max player moves first. In the case alpha = beta, prune the node. Enter -100 if you think the answer is negative infinity.
📗 Answer: .
📗 [4 points] Enter the largest integer value of \(A\) such that \(B\) will be alpha-beta pruned? Min player moves first. In the case alpha = beta, prune the node. Enter 100 if you think the answer is infinity.
📗 Answer: .
📗 [3 points] Select the values of \(A\) such that \(B\) will be alpha-beta pruned? The player moves first. In the case alpha = beta, prune the node.
📗 Choices:
None of the above
📗 [3 points] Which nodes are pruned by alpha-beta pruning? The player moves first.
📗 Select the nodes:
select
📗 [4 points] Consider the following zero-sum game tree. MAX 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.
📗 Answer: .
📗 [4 points] Consider the following zero-sum game tree. MIN 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.
📗 Answer: .
📗 [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: .
📗 [4 points] For a zero-sum game in which moves first and the value to the MAX player is given in the diagram below, consider the static board evaluation (heuristic function) at the internal states provided in the table below. What are the smallest and largest possible values of \(x\) above and below which IDS (iterative deepening search) with depth limit \(1\) will find the correct solution for the game? You can assume all values are between \(-100\) and \(100\). Enter two numbers between \(-100\) and \(100\) (possibly including \(-100\), \(100\)).
📗 Note: for example, if you think \(10 < x < 20\), enter \(10, 20\); if you think any \(x > 10\) works, enter \(10, 100\); if you think any \(x < 20\) works, enter \(-100, 20\); if you think every \(x\) is okay, enter \(-100, 100\); if you think no such \(x\) exist, enter \(-100, -100\) or \(100, 100\).
📗 You could save the text in the above text box to a file using the button or copy and paste it into a file yourself .
📗 You could load your answers from the text (or txt file) in the text box below using the button . The first two lines should be "##m: 28" and "##id: your id", and the format of the remaining lines should be "##1: your answer to question 1" newline "##2: your answer to question 2", etc. Please make sure that your answers are loaded correctly before submitting them.
📗 You can find videos going through the questions on Link.