1. 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
Explanation: Alpha-beta search updates the value of alpha and beta as it gets along and prunes the remaining branches at node.
2. 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
Explanation: Depends on the nodes
3. 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.
4. 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
Explanation: Transposition table
5. 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
Explanation: Because we need to cut the search off at some point and apply an evaluation function that gives an estimate of the utility of the state.
6. Which is the most straightforward approach for planning algorithm?
a) Best-first search
b) State-space search
c) Depth-first search
d) Hill-climbing search
Explanation: The straightforward approach for planning algorithm is state space search because it takes into account of everything for finding a solution.
7. How many ways are available to solve the state-space search?
a) 1
b) 2
c) 3
d) 4
Explanation: There are two ways available to solve the state-space search. They are forward from the initial state and backward from the goal.
8. What is the other name for forward state-space search?
a) Progression planning
b) Regression planning
c) Test planning
d) None of the mentioned
Explanation: It is sometimes called as progression planning, because it moves in the forward direction.
9. What is the other name of the backward state-space search?
a) Regression planning
b) Progression planning
c) State planning
d) Test planning
Explanation: Backward state-space search will find the solution from goal to the action, So it is called as Regression planning.
10. Which approach is to pretend that a pure divide and conquer algorithm will work?
a) Goal independence
b) Subgoal independence
c) Both Goal & Subgoal independence
d) None of the mentioned
Explanation: Subgoal independence approach is to pretend that a pure divide and conquer algorithm will work for admissible heuristics.