c) Alpha-beta pruning
Explanation: The alpha-beta search computes the same optimal moves as minimax, but eliminates the branches that can't influence the final decision.
Which values are independent in minimax search algorithm? a) Pruned leaves x and y b) Every state is dependent c) Root is independent d) None of the mentioned
Which value is assigned to alpha and beta in the alpha-beta pruning? a) Alpha = max b) Beta = min c) Beta = max d) Both a & b
To which depth does the alpha-beta pruning can be applied? a) 10 states b) 8 States c) 6 States d) Any depth
Which search is similar to minimax search? a) Hill-climbing search b) Depth-first search c) Breadth-first search d) All 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
Where does the values of alpha-beta search get updated? a) Along the path of search b) Initial state itself c) At the end d) None of the mentioned
Which function is used to calculate the feasibility of whole game tree? a) Evaluation function b) Transposition c) Alpha-beta pruning d) All of the mentioned
Which is identical to the closed list in Graph search? a) Hill climbing search algorithm b) Depth-first search c) Transposition table d) None of the mentioned
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) Both a & b d) None of the mentioned
The complexity of minimax algorithm is a) Same as of DFS b) Space - bm and time - bm c) Time - bm and space - bm d) Same as BFS
rendc.org
Whether it is technological solutions or user-oriented innovations, We have put together for you the best sources of HR Interview Questions and Answers, Tech Ideas, and Programming Tutorials."
Get all the latest information on rendc.org
© 2022 | All rights reserved.
RENDC
welcome to www.rendc.org
