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

Discussion

When does alpha beta pruning cut off a branch?

  • A.When both players have the same value at a node
  • B.When a node's value cannot affect the value at the root
  • C.When the evaluation function returns a very low value
  • D.When the search has reached its maximum permitted depth

Answer: B

A branch is abandoned as soon as it is proved that the value at the root is already determined regardless of what the branch contains, which happens when a minimiser finds a value at or below alpha, or a maximiser one at or above beta. Low evaluations, depth limits and equal values are unrelated conditions. Pruning that is provably safe, changing the search's cost but not its result, is a different and stronger thing than pruning by heuristic judgement.

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

Post your comment

Please log in or register to post a comment.