- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
On the branching factor of the alpha-beta pruning algorithm
Artificial Intelligence 10 (2):173-199 (1978)
Abstract
This article has no associated abstract. (fix it)My notes
Similar books and articles
A quantitative analysis of the alpha-beta pruning algorithm.Nevin M. Darwish - 1983 - Artificial Intelligence 21 (4):405-433.
Bounds for the closure ordinals of essentially monotonic increasing functions.Andreas Weiermann - 1993 - Journal of Symbolic Logic 58 (2):664-671.
An analysis of alpha-beta pruning.Donald E. Knuth & Ronald W. Moore - 1975 - Artificial Intelligence 6 (4):293-326.
Possible PCF algebras.Thomas Jech & Saharon Shelah - 1996 - Journal of Symbolic Logic 61 (1):313-317.
Ordinal Inequalities, Transfinite Induction, and Reverse Mathematics.Jeffry Hirst - 1999 - Journal of Symbolic Logic 64 (2):769-774.
A minimax algorithm better than alpha-beta?G. C. Stockman - 1979 - Artificial Intelligence 12 (2):179-196.
A minimax algorithm better than alpha-beta? Yes and No.Igor Roizen & Judea Pearl - 1983 - Artificial Intelligence 21 (1-2):199-220.
Periodicite Des Theories Elementaires Des Corps De Series Formelles Iterees.Françoise Delon - 1986 - Journal of Symbolic Logic 51 (2):334-351.
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.
On the Existence of Strong Chains in $\wp$/Fin.Piotr Koszmider - 1998 - Journal of Symbolic Logic 63 (3):1055-1062.
A Lambda Proof Of The P-w Theorem.Sachio Hirokawa, Yuichi Komori & Misao Nagayama - 2000 - Journal of Symbolic Logic 65 (4):1841-1849.
Analytics
Added to PP
2020-12-22
Downloads
7 (#1,356,784)
6 months
4 (#790,687)
2020-12-22
Downloads
7 (#1,356,784)
6 months
4 (#790,687)
Historical graph of downloads
Citations of this work
A minimax algorithm better than alpha-beta?G. C. Stockman - 1979 - Artificial Intelligence 12 (2):179-196.
Asymptotic properties of minimax trees and game-searching procedures.Judea Pearl - 1980 - Artificial Intelligence 14 (2):113-138.
Pathology on game trees revisited, and an alternative to minimaxing.Dana S. Nau - 1983 - Artificial Intelligence 21 (1-2):221-244.
A comparison of minimax tree search algorithms.Murray S. Campbell & T. A. Marsland - 1983 - Artificial Intelligence 20 (4):347-367.
On the nature of pathology in game searching.Judea Pearl - 1983 - Artificial Intelligence 20 (4):427-453.
References found in this work
An analysis of alpha-beta pruning.Donald E. Knuth & Ronald W. Moore - 1975 - Artificial Intelligence 6 (4):293-326.
The efficiency of the alpha-beta search on trees with branch-dependent terminal node scores.M. M. Newborn - 1977 - Artificial Intelligence 8 (2):137-153.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-7c76586df8-4c2ch uwo