THE HUMAN IMMUNE SYSTEM
AIDS
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Along the path of search
|
|
|
Initial state itself
|
|
|
At the end
|
|
|
None of the mentioned
|
Detailed explanation-1: -Where does the values of alpha-beta search get updated? Explanation: Alpha-beta search updates the value of alpha and beta as it gets along and prunes the remaining branches at node.
Detailed explanation-2: -alpha + beta =-b/a. Then how to find (alpha-beta) Also let A=+1−1, +1−1 and B=2−1, 2+1 If A ∩B≠, then find all the permissible value of parameter “a".
Detailed explanation-3: -The Max player will only update the value of alpha. The Min player will only update the value of beta. While backtracking the tree, the node values will be passed to upper nodes instead of values of alpha and beta. We will only pass the alpha, beta values to the child nodes.
Detailed explanation-4: -Which value is assigned to alpha and beta in the alpha-beta pruning? Explanation : Alpha and beta are the values of the best choice we have found so far at any choice point along the path for MAX and MIN.
Detailed explanation-5: -Alpha-Beta pruning is not actually a new algorithm, but rather an optimization technique for the minimax algorithm. It reduces the computation time by a huge factor. This allows us to search much faster and even go into deeper levels in the game tree.