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

Discussion

What determines how much alpha beta actually prunes?

  • A.The order in which moves are examined at each node
  • B.The depth to which the search is permitted to run
  • C.The accuracy of the evaluation function at the leaves
  • D.The total number of legal moves in the position

Answer: A

Examining the best move first establishes a strong bound immediately and allows everything else to be cut, while examining the worst first prunes nothing at all. Perfect ordering gives the square root improvement and random ordering gives roughly the three quarters power. Depth, evaluation quality and move count matter but do not control the pruning. That an algorithm's benefit depends entirely on a heuristic choice made outside it is unusual and it makes move ordering a first class concern.

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

Post your comment

Please log in or register to post a comment.