Question 8. (SU8) [10] 8.1 What is the advantage of adding alpha-beta pruning to a minimax algorithm? (4) 8.2 A game tre

[correctanswer]

Question 8 Su8 10 8 1 What Is The Advantage Of Adding Alpha Beta Pruning To A Minimax Algorithm 4 8 2 A Game Tre 1 (82.98 KiB) Viewed 81 times

Question 8. (SU8) [10] 8.1 What is the advantage of adding alpha-beta pruning to a minimax algorithm? (4) 8.2 A game tree uses alpha-beta pruning and has a branching factor b and a search horizon depth d. Using big-oh notation, what is the space usage of this game tree? (2) 8.3 In the game tree below, the value below each node is the static evaluation at that node. MAX next to a horizontal line of nodes means that the maximizer is choosing on that turn, and MIN means that the minimizer is choosing on that turn. MAX A)6 MIN B)2 D 1 MAX E H J)20 2 6 1 MIN K P 3 2 20 MAX Ꭱ 1 10 8.3.1 Using minimax without Alpha-Beta pruning, which of the three possible moves should the maximizer take at node A? 8.3.2 What will be the final minimax value of node A? ليا F 3 M N 6 (2) (2)