Switch to: References

Citations of:

A minimax algorithm better than alpha-beta?

G. C. Stockman

Artificial Intelligence 12 (2):179-196 (1979)

Add citations

You must login to add citations.

Asymptotic properties of minimax trees and game-searching procedures.Judea Pearl - 1980 - Artificial Intelligence 14 (2):113-138.details Download Export citation Bookmark 12 citations
Conspiracy numbers for min-max search.David Allen McAllester - 1988 - Artificial Intelligence 35 (3):287-310.details Download Export citation Bookmark 14 citations
A minimax algorithm better than alpha-beta? Yes and No.Igor Roizen & Judea Pearl - 1983 - Artificial Intelligence 21 (1-2):199-220.details Download Export citation Bookmark 8 citations
Best-first minimax search.Richard E. Korf & David Maxwell Chickering - 1996 - Artificial Intelligence 84 (1-2):299-337.details Download Export citation Bookmark 6 citations
A comparison of minimax tree search algorithms.Murray S. Campbell & T. A. Marsland - 1983 - Artificial Intelligence 20 (4):347-367.details Download Export citation Bookmark 9 citations
A general branch and bound formulation for understanding and synthesizing and/or tree search procedures.Vipin Kumar & Laveen N. Kanal - 1983 - Artificial Intelligence 21 (1-2):179-198.details Download Export citation Bookmark 4 citations
Generalization of alpha-beta and SSS∗ search procedures.T. Ibaraki - 1986 - Artificial Intelligence 29 (1):73-117.details Download Export citation Bookmark 2 citations
Computer Go: An AI oriented survey.Bruno Bouzy & Tristan Cazenave - 2001 - Artificial Intelligence 132 (1):39-103.details Download Export citation Bookmark 8 citations
Pathology on game trees revisited, and an alternative to minimaxing.Dana S. Nau - 1983 - Artificial Intelligence 21 (1-2):221-244.details Download Export citation Bookmark 10 citations
Proof-number search.L. Victor Allis, Maarten van der Meulen & H. Jaap van den Herik - 1994 - Artificial Intelligence 66 (1):91-124.details Download Export citation Bookmark 6 citations
A quantitative analysis of the alpha-beta pruning algorithm.Nevin M. Darwish - 1983 - Artificial Intelligence 21 (4):405-433.details Download Export citation Bookmark 1 citation
Best-first fixed-depth minimax algorithms.Aske Plaat, Jonathan Schaeffer, Wim Pijls & Arie de Bruin - 1996 - Artificial Intelligence 87 (1-2):255-293.details Download Export citation Bookmark 5 citations
The last player theorem.Dana S. Nau - 1982 - Artificial Intelligence 18 (1):53-65.details Download Export citation Bookmark 5 citations
Game tree searching by min/max approximation.Ronald L. Rivest - 1987 - Artificial Intelligence 34 (1):77-96.details Download Export citation Bookmark 5 citations
Time-efficient state space search.Alexander Reinefeld & Peter Ridinger - 1994 - Artificial Intelligence 71 (2):397-408.details Download Export citation Bookmark 1 citation
General Branch and Bound, and its relation to A∗ and AO∗.Dana S. Nau, Vipin Kumar & Laveen Kanal - 1984 - Artificial Intelligence 23 (1):29-58.details Download Export citation Bookmark 2 citations
Low overhead alternatives to SSS∗.T. A. Marsland, Alexander Reinefeld & Jonathan Schaeffer - 1987 - Artificial Intelligence 31 (2):185-199.details Download Export citation Bookmark 5 citations
Searching game trees under a partial order.Pallab Dasgupta, P. P. Chakrabarti & S. C. DeSarkar - 1996 - Artificial Intelligence 82 (1-2):237-257.details Download Export citation Bookmark 2 citations
A game tree with distinct leaf values which is easy for the alpha-beta algorithm.Ingo Althöfer & Bernhard Balkenhol - 1991 - Artificial Intelligence 52 (2):183-190.details Download Export citation Bookmark

1