Machine-translated by Google. Questions are authored in English.
Top

Discussion

α - β cutoffs are applied to ______

  • A.Depth first search
  • B.Best first search
  • C.Minimax search
  • D.Breadth first search

Answer: C

Alpha-beta cutoffs are applied to Minimax search. Alpha-beta pruning keeps the best values found so far for the maximising and minimising players and stops exploring a branch that cannot change the minimax value, so it gives the same result with fewer nodes.

Depth first, best first and breadth first search are uninformed or heuristic search methods over a graph and have no max and min players, so there is nothing to prune with an alpha and a beta value. Alpha-beta cutoffs belong to two-player game trees, which is minimax search.

No comment is present. Be the first to comment.
Loading…

Post your comment

Please log in or register to post a comment.