# Alpha–beta pruning

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2012

2012

- AAAI
- 2012

Alpha-Beta pruning is one of the most powerful and fundamental MiniMax search improvements. It was designed for sequential two… (More)

Is this relevant?

2012

2012

- 2012

Many game-playing programs must search very large game trees. Use of the alpha-beta pruning algorithm instead of the simple… (More)

Is this relevant?

2009

2009

- WRI World Congress on Computer Science and…
- 2009

The game playing is an import domain of heuristic search, and its procedure is represented by a special and/or tree. Alpha-beta… (More)

Is this relevant?

2001

2001

- 2001

Alpha-beta pruning is the algorithm of choice for searching game trees with position values taken from a totally ordered set… (More)

Is this relevant?

1991

1991

- Artif. Intell.
- 1991

Korf, R.E., Multi-player alpha-beta pruning (Research Note), Artificial Intelligence 48 (1991) 99-111. We consider the… (More)

Is this relevant?

1988

1988

- AAAI
- 1988

We propose a parallel tree search algorithm based on the idea of tree-decomposition in which different processors search… (More)

Is this relevant?

1983

1983

- Artif. Intell.
- 1983

Since the earl). 70s the question o]" efficiency of the alpha-beta pruning algorithm has been of interest to those who have been… (More)

Is this relevant?

Highly Cited

1979

Highly Cited

1979

- Artif. Intell.
- 1979

An algorithm based on state space search is introduced for computing the minimax value o f game trees. The new algorithm SSS, is… (More)

Is this relevant?

1978

1978

- STOC
- 1978

An analysis of the alpha-beta pruning algorithm is presented which takes into account both shallow and deep cut-offs. A formula… (More)

Is this relevant?

Highly Cited

1975