Write the pseudo algorithm of minimax alpha beta pruning. 2. Use the alpha beta pruning algorithm to prune the above game tree: ◦ Nodes on which values are written will be considered as terminal. ◦ Player for each level is defined. ◦ In the end write the show all the final alpha beta values of each node, optimal value of this whole game tree. Also show the pruned branches. Sample Output: Level 0 : [11] Level 1 : Node 1 = [5] , Node 2 = [12] , Node 3 = [7] Level 2 : Node 1 = [13] , Node 2 = [5] , Node 3 = [16] , Node 4 = [1] , Node 5 = [12] , Node 6 = [8] , Node 7 = [pruned]
1. Write the pseudo
2. Use the alpha beta pruning algorithm to prune the above game tree:
◦ Nodes on which values are written will be considered as terminal.
◦ Player for each level is defined.
◦ In the end write the show all the final alpha beta values of each node, optimal value of
this whole game tree. Also show the pruned branches.
Sample Output:
Level 0 : [11]
Level 1 : Node 1 = [5] , Node 2 = [12] , Node 3 = [7]
Level 2 : Node 1 = [13] , Node 2 = [5] , Node 3 = [16] , Node 4 = [1] , Node 5 = [12] ,
Node 6 = [8] , Node 7 = [pruned]
Level 3 : Node 1 = [4] , Node 2 = [13] , Node 3 = [10] , Node 4 = [11] , Node 5 = [1] ,
Node 6 = [9] , Node 7 = [6 , branch 2 is pruned] , Node 8 = [10] , Node 9 = [8],
Node 10= [5] , Node 11 = [7] , Node 12 = [4]
Optimal Value is 6.
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 3 images
