To which depth does the alpha-beta pruning can be applied?
a) 10 states
b) 8 States
c) 6 States
d) Any depth
Explanation: Alpha–beta pruning can be applied to trees of any depth and it is possible to prune entire subtree rather than leaves.
Which search is similar to minimax search?
a) Hill-climbing search
b) Depth-first search
c) Breadth-first search
d) All of the mentioned
Explanation: The minimax search is depth-first search, So at one time we just have to consider the nodes along a single path in the tree.
Which value is assigned to alpha and beta in the alpha-beta pruning?
a) Alpha = max
b) Beta = min
c) Beta = max
d) Both Alpha = max & Beta = min
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.
Where does the value of alpha-beta search get updated?
a) Along the path of search
b) Initial state itself
c) At the end
d) None of these
Explanation: Alpha-beta search updates the value of alpha and beta as it gets along and prunes the remaining branches at node.
How the effectiveness of the alpha-beta
pruning gets increased?
a) Depends on the nodes
b) Depends on the order in which they are executed
c) All of the mentioned
d) None of the mentioned
What is called as transposition table?
a) Hash table of next seen positions
b) Hash table of previously seen positions
c) Next value in the search
d) None of the mentioned
Explanation: Transposition is the occurrence of repeated states frequently in the search.
