b) Hash table of previously seen positions
Explanation: Transposition is the occurrence of repeated states frequently in the search.
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
The minimax algorithm (Figure 6.3) computes the minimax decision from the current state. It uses a simple recursive computation of the minimax values of each successor state, directly implementing the defining equations. The recursion proceeds all the way down to the leaves of the tree, and then the minimax values are backed up through the tree as the recursion unwinds. a) True b) False
Zero sum game has to be a ______ game. a) Single player b) Two player c) Multiplayer d) Three player
Zero sum games are the one in which there are two agents whose actions must alternate and in which the utility values at the end of the game are always the same. a) True b) False
The initial state and the legal moves for each side define the __________ for the game. a) Search Tree b) Game Tree c) State Space Search d) Forest
Adversarial search problems uses, a) Competitive Environment b) Cooperative Environment c) Neither a nor b d) Only a and b
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
