Alpha Beta Pruning MCQ Questions

11. Which search is equal to minimax search but eliminates the branches that can’t influence the final decision?

A. Depth-first search
B. Breadth-first search
C. Alpha-beta pruning
D. None of the above

View Answer


12. Which values are independant in minimax search algorithm?

A. Pruned leaves x and y
B. Every states are dependant
C. Root is independant
D. None of the above

View Answer


13. To which depth does the alpha-beta pruning can be applied?

A. 10 states
B. 12 states
C. 8 states
D. Any States

View Answer


14. Which search is similar to minimax search?

A. Hill-climbing search
B. Depth-first search
C. Breadth-first search
D. All of the above

View Answer


15. Which value is assigned to alpha and beta in the alpha-beta pruning?

A. alpha = max
B. alpha = min
C. beta = min
D. Both A and C

View Answer


16. 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 above

View Answer


17. We will only pass the alpha, beta values to the child nodes.

A. TRUE
B. FALSE
C. Can be true or false
D. Can not say

View Answer


18. Which ordering consumes more time because of alpha-beta factors?

A. Ideal ordering
B. Worst ordering
C. Both A and B
D. None of the above

View Answer


19. In which year Donald Knuth and Ronald W. Moore refined the algorithm?

A. 1970
B. 1975
C. 1980
D. 1985

View Answer


20. 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 above

View Answer





Discussion


* You must be logged in to add comment.