- K Problem 4 Game Playing And Expected Values Consider The Following Game Tree In Which The Evaluation Function Values 1 (123.76 KiB) Viewed 94 times
- K Problem 4 Game Playing And Expected Values Consider The Following Game Tree In Which The Evaluation Function Values 2 (18.99 KiB) Viewed 94 times
K Problem 4 - Game Playing and Expected Values 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 minimising player. That is, the first player (MIN) is trying to minimise the final score. Assume that the search always visits children left-to- right. E 1. Clearly indicate the max and min layers of the tree AND use minimax to determine the best first move for MIN. L B M F 1 5 9 3 N G P A C Q H R S I D T 9 7 8 7 2 3 5 6 U J V
2. In which order will the nodes be examined by the alpha-beta procedure? Which nodes will be pruned by the alpha-beta procedure?