Alpha Beta Pruning MCQ

Test your knowledge with important Alpha Beta Pruning MCQ and their applications. These MCQs are beneficial for competitive exams too. Explore 30 + more Alpha Beta Pruning MCQs at Bissoy

• Which function is used to calculate the feasibility of whole game tree?
  ক

  Evaluation function

  খ

  Transposition

  গ

  Alpha-beta pruning

  ঘ

  All of the mentioned
• Which is identical to the closed list in Graph search?
  ক

  Hill climbing search algorithm

  খ

  Depth-first search

  গ

  Transposition table

  ঘ

  None of the mentioned
• What is called as transposition table?
  ক

  Hash table of next seen positions

  খ

  Hash table of previously seen positions

  গ

  Next value in the search

  ঘ

  None of the mentioned
• How the effectiveness of the alpha-beta pruning gets increased?
  ক

  Depends on the nodes

  খ

  Depends on the order in which they are executed

  গ

  All of the mentioned

  ঘ

  None of the mentioned
• Where does the values of alpha-beta search get updated?
  ক

  Along the path of search

  খ

  Initial state itself

  গ

  At the end

  ঘ

  None of the mentioned
• Which value is assigned to alpha and beta in the alpha-beta pruning?
  ক

  Alpha = max

  খ

  Beta = min

  গ

  Beta = max

  ঘ

  Both Alpha = max & Beta = min
• Which search is similar to minimax search?
  ক

  Hill-climbing search

  খ

  Depth-first search

  গ

  Breadth-first search

  ঘ

  All of the mentioned
• To which depth does the alpha-beta pruning can be applied?
  ক

  10 states

  খ

  8 States

  গ

  6 States

  ঘ

  Any depth
• Which values are independant in minimax search algorithm?
  ক

  Pruned leaves x and y

  খ

  Every states are dependant

  গ

  Root is independant

  ঘ

  None of the mentioned
• Which search is equal to minimax search but eliminates the branches that can’t influence the final decision?
  ক

  Depth-first search

  খ

  Breadth-first search

  গ

  Alpha-beta pruning

  ঘ

  None of the mentioned