Problem 4 - Game Playing and Expected Values (15 marks) Consider the following game tree in which the evaluation functio

[answerhappygod]

Problem 4 Game Playing And Expected Values 15 Marks Consider The Following Game Tree In Which The Evaluation Functio 1 (44.03 KiB) Viewed 44 times

Problem 4 - Game Playing and Expected Values (15 marks) Consider the following game tree in which the evaluation function values are shown below each leaf node. Assume that the root node corresponds to the maximising player. That is, the first player (MAX) is trying to maximise the final score. Assume that the search always visits children left-to-right. For each of the following questions, choose one option: 1. According to minimax, the best first move for player MAX at node A is: (a) MAX moves from node A to node B (b) MAX moves from node A to node C (c) MAX moves from node A to node D (d) MAX moves from node A to node E (5 marks 2. Using alpha-beta pruning, the following nodes will be pruned from the search tree during the search process: (a) J,L,Q,R will be pruned. (b) I,O,P,J,L,Q,R will be pruned. (c) L,Q,R will be pruned. (d) L,Q,R,N will be pruned. (e) J,N will be pruned. (f) G,J,L,Q,R,N will be pruned.