A quantitative analysis of the alpha-beta pruning algorithm

摘要

Since the early 70s the question of efficiency of the alpha-beta pruning algorithm has been of interest to those who have been working on game-playing programs. In this paper, we present a quantitative study of the algorithm deriving estimates for its efficiency based on the scoring scheme suggested by Newborn [7].