Question

Question No: 04 Consider the below game tree where a-?-Minimax search algorithm is applied. Answer the following questions. [5+3=8 Marks] c) Illustrate the alpha-beta cut-off (pruning) with step by step change in ? & ? values in every iteration. Show the pruned region clearly in the given tree and specify the number of cuts done by ?-pruning and ?-pruning separately. d) Consider a smaller game tree formed by only the nodes N5, N11, N12 and prove that "If the order of exploration of the leafs/game moves are swapped it changes the pruning while applying alpha-beta cut-off (pruning)"

          Question No: 04
Consider the below game tree where a-?-Minimax search algorithm is applied. Answer the
following questions.
[5+3=8 Marks]
c) Illustrate the alpha-beta cut-off (pruning) with step by step change in ? & ? values
in every iteration. Show the pruned region clearly in the given tree and specify the
number of cuts done by ?-pruning and ?-pruning separately.
d) Consider a smaller game tree formed by only the nodes N5, N11, N12 and prove
that "If the order of exploration of the leafs/game moves are swapped it changes
the pruning while applying alpha-beta cut-off (pruning)"

Question No: 04
Consider the below game tree where a-?-Minimax search algorithm is applied. Answer the
following questions.
[5+3=8 Marks]
c) Illustrate the alpha-beta cut-off (pruning) with step by step change in ? ? values
in every iteration. Show the pruned region clearly in the given tree and specify the
number of cuts done by ?-pruning and ?-pruning separately.
d) Consider a smaller game tree formed by only the nodes N5, N11, N12 and prove
that "If the order of exploration of the leafs/game moves are swapped it changes
the pruning while applying alpha-beta cut-off (pruning)"

Added by Brianna J.

Question

Please give Ace some feedback