Question 1 : Which function is used to calculate the feasibility of whole game tree?
1. Evaluation function
2. Transposition
3. Alpha-beta pruning
4. All of the mentioned
View Answer   Discuss with Members

Question 2 : Which is identical to the closed list in Graph search?
1. Hill climbing search algorithm
2. Depth-first search
3. Transposition table
4. None of the mentioned
View Answer   Discuss with Members

Question 3 : What is called as transposition table?
1. Hash table of next seen positions
2. Hash table of previously seen positions
3. Next value in the search
4. None of the mentioned
View Answer   Discuss with Members

Question 4 : How the effectiveness of the alpha-beta pruning gets increased?
1. Depends on the nodes
2. Depends on the order in which they are executed
3. All of the mentioned
4. None of the mentioned
View Answer   Discuss with Members

Question 5 : Where does the values of alpha-beta search get updated?
1. Along the path of search
2. Initial state itself
3. At the end
4. None of the mentioned
View Answer   Discuss with Members

Question 6 : Which value is assigned to alpha and beta in the alpha-beta pruning?
1. Alpha = max
2. Beta = min
3. Beta = max
4. Both Alpha = max & Beta = min
View Answer   Discuss with Members

Question 7 : Which search is similar to minimax search?
1. Hill-climbing search
2. Depth-first search
3. Breadth-first search
4. All of the mentioned
View Answer   Discuss with Members

Question 8 : To which depth does the alpha-beta pruning can be applied?
1. 10 states
2. 8 States
3. 6 States
4. Any depth
View Answer   Discuss with Members

Question 9 : Which values are independant in minimax search algorithm?
1. Pruned leaves x and y
2. Every states are dependant
3. Root is independant
4. None of the mentioned
View Answer   Discuss with Members

Question 10 : Which approach is to pretend that a pure divide and conquer algorithm will work?
1. Goal independence
2. Subgoal independence
3. Both Goal & Subgoal independence
4. None of the mentioned
View Answer   Discuss with Members