Alpha-beta pruning is a modified version of the?a.maximax algorithmb.minimax algorithmc.minimin algorithmd.maximin algorithm

Alpha-Beta pruning can change the final decision made by the Minimax algorithm.

Which value is assigned to alpha and beta in the alpha-beta pruning?

Which value is assigned to alpha and beta in the alpha-beta pruning?ans.Beta = maxAlpha = maxBeta = minBoth Alpha = max & Beta = min Previous Marked for Review Next

Which of the following is/are false regarding the alpha-beta pruning for the mini-max search algorithm? It can potentially lead to suboptimal solutions compared to mini-max search without any pruning It is guaranteed to improve the running time in-comparison to the mini-max search without any pruning The order in which nodes are visited affects the amount of pruning If the successors of a node are chosen randomly, the time complexity (on average) is O(b3m/4)

The main condition which required for alpha-beta pruning is?a.alpha<=betab.alpha!=betac.alpha=betad.alpha>=beta