Question

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

Answer 1

Alpha = max Beta = min Beta = max Both a & b.

Hope this will help you...

Answer 2

Answer:

The algorithm maintains two values, alpha and beta. These represent the minimum score promised to the maximizing player  and the maximum score promised to the minimizing player, respectively. Initially, alpha is negative infinity and beta is positive infinity. Both players start with the worst possible result.

Explanation:

• The alpha-beta method is a search algorithm that attempts to reduce the number of nodes  evaluated by the minimax algorithm in a search tree. This is a hostile search algorithm commonly used in two-player games played on machines.
• Stop evaluating the move if at least one possibility is found that proves that the move is worse than the previously examined move. There is no need to further evaluate such movements. When applied to a standard minimax tree, it returns the same behaviour as the minimax, but cuts out branches that may not affect the final decision.
• Whenever the maximum score given to a minimized player (i.e., "beta" player) is  less than the minimum score given to a maximized player (i.e., "alpha" player) i.e., beta  the  descendants of this node as they will not be reached in the actual game.

#SPJ3