[Solved]-Question 3 Smaller Version Connect 4 Played Vertical Board 3 Row High 3 Column Wide Two Pl Q37250315

Question 3: A smaller version of Connect 4 is played on a vertical board 3-row high and 3-column wide. The two players Maxim and Minnie alternately drop a black and white disc, respectively, from the top of any column, and it will fall to the lowest open row. A player wins when three of his/her discs are aligned either horizontally, vertically, or diagonally; otherwise the game is a draw. Consider the sample game below, where the first four moves have already been played. 2 3 4 (a) The game tree below shows all possible moves after Maxim dropped his next disc (X) in the right-most column. Apply the Minimax algorithm, marking the value of each node as 1 if Maxim wins, -1 if Minnie wins, and 0 if they draw. Indicate accordingly the expected result of the game. Show which outcomes are possible, should a mistake occur. (3 marks) Minnie 0 X O Maxim X O XO X MinnieXO XO X 0 O Minnie Maxim X O X O XO X MinnieXO XO X 0 O X X O Maxim X O X XO X XO X XO X X X O X O X MinnieXO O XOX (b) Highlight on the game tree in part (a) the nodes that will not be evaluated if using alpha-beta pruning. Assume nodes are generated in the left-to-right order. Comment on the improvement, if any. (2 marks) (c) Suppose Maxim dropped his next disc in the centre column, instead of the right-most column as in parts (a-b). Draw the 10-node portion of the game tree below that starts with that move. Apply the Minimax algorithm, clearly marking the node values, and comment on the result. (2 marks) (c) Suppose Maxim dropped his next disc in the centre column, instead of the right-most column as in parts (a-b). Draw the 10-node portion of the game tree below that starts with that move. Apply the Minimax algorithm, clearly marking the node values, and comment on the result. (2 marks) Minnie x X Show transcribed image text Question 3: A smaller version of Connect 4 is played on a vertical board 3-row high and 3-column wide. The two players Maxim and Minnie alternately drop a black and white disc, respectively, from the top of any column, and it will fall to the lowest open row. A player wins when three of his/her discs are aligned either horizontally, vertically, or diagonally; otherwise the game is a draw. Consider the sample game below, where the first four moves have already been played. 2 3 4 (a) The game tree below shows all possible moves after Maxim dropped his next disc (X) in the right-most column. Apply the Minimax algorithm, marking the value of each node as 1 if Maxim wins, -1 if Minnie wins, and 0 if they draw. Indicate accordingly the expected result of the game. Show which outcomes are possible, should a mistake occur. (3 marks) Minnie 0 X O Maxim X O XO X MinnieXO XO X 0 O
Minnie Maxim X O X O XO X MinnieXO XO X 0 O X X O Maxim X O X XO X XO X XO X X X O X O X MinnieXO O XOX (b) Highlight on the game tree in part (a) the nodes that will not be evaluated if using alpha-beta pruning. Assume nodes are generated in the left-to-right order. Comment on the improvement, if any. (2 marks) (c) Suppose Maxim dropped his next disc in the centre column, instead of the right-most column as in parts (a-b). Draw the 10-node portion of the game tree below that starts with that move. Apply the Minimax algorithm, clearly marking the node values, and comment on the result. (2 marks)
(c) Suppose Maxim dropped his next disc in the centre column, instead of the right-most column as in parts (a-b). Draw the 10-node portion of the game tree below that starts with that move. Apply the Minimax algorithm, clearly marking the node values, and comment on the result. (2 marks) Minnie x X

Expert Answer

---

Answer to Question 3: A smaller version of Connect 4 is played on a vertical board 3-row high and 3-column wide. The two players M… . . .