A quantitative analysis of the alpha-beta pruning algorithm

Authors:
Nevin M. Darwish
Affiliations:
-
Venue:
Artificial Intelligence
Year:
1983

Citing 3
Cited 0

Experiments With a Multipurpose, Theorem-Proving Heuristic Program

Journal of the ACM (JACM)
Problem-Solving Methods in Artificial Intelligence

Problem-Solving Methods in Artificial Intelligence
On the branching factor of the alpha-beta pruning algorithm

Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

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].