- 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
Pathology on game trees revisited, and an alternative to minimaxing
Artificial Intelligence 21 (1-2):221-244 (1983)
Abstract
This article has no associated abstract. (fix it)My notes
Similar books and articles
The effect of mobility on minimaxing of game trees with random leaf values.Mark Levene & Trevor I. Fenner - 2001 - Artificial Intelligence 130 (1):1-26.
On the nature of pathology in game searching.Judea Pearl - 1983 - Artificial Intelligence 20 (4):427-453.
Benefits of using multivalued functions for minimaxing.Anton Scheucher & Hermann Kaindl - 1998 - Artificial Intelligence 99 (2):187-208.
Searching game trees under a partial order.Pallab Dasgupta, P. P. Chakrabarti & S. C. DeSarkar - 1996 - Artificial Intelligence 82 (1-2):237-257.
The multi-player version of minimax displays game-tree pathology.David Mutchler - 1993 - Artificial Intelligence 64 (2):323-336.
Asymptotic properties of minimax trees and game-searching procedures.Judea Pearl - 1980 - Artificial Intelligence 14 (2):113-138.
An investigation of the causes of pathology in games.Dana S. Nau - 1982 - Artificial Intelligence 19 (3):257-278.
Thomas F. Gordon, The Pleadings Game – An Artificial Intelligence Model of Procedural Justice. [REVIEW]Arno R. Lodder - 2000 - Artificial Intelligence and Law 8 (2-3):255-264.
Uncovering trees in constraint networks.Itay Meiri, Rina Dechter & Judea Pearl - 1996 - Artificial Intelligence 86 (2):245-267.
Perfect knowledge revisited.S. T. Dekker, H. J. van den Herik & I. S. Herschberg - 1990 - Artificial Intelligence 43 (1):111-123.
Analytics
Added to PP
2020-12-22
Downloads
10 (#1,221,414)
6 months
6 (#588,512)
2020-12-22
Downloads
10 (#1,221,414)
6 months
6 (#588,512)
Historical graph of downloads
Citations of this work
Conspiracy numbers for min-max search.David Allen McAllester - 1988 - Artificial Intelligence 35 (3):287-310.
A Bayesian approach to relevance in game playing.Eric B. Baum & Warren D. Smith - 1997 - Artificial Intelligence 97 (1-2):195-242.
Game tree searching by min/max approximation.Ronald L. Rivest - 1987 - Artificial Intelligence 34 (1):77-96.
Limited lookahead in imperfect-information games.Christian Kroer & Tuomas Sandholm - 2020 - Artificial Intelligence 283 (C):103218.
Benefits of using multivalued functions for minimaxing.Anton Scheucher & Hermann Kaindl - 1998 - Artificial Intelligence 99 (2):187-208.
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 B∗ tree search algorithm: A best-first proof procedure.Hans Berliner - 1979 - Artificial Intelligence 12 (1):23-40.
A minimax algorithm better than alpha-beta?G. C. Stockman - 1979 - Artificial Intelligence 12 (2):179-196.
On the branching factor of the alpha-beta pruning algorithm.Gérard M. Baudet - 1978 - Artificial Intelligence 10 (2):173-199.
Asymptotic properties of minimax trees and game-searching procedures.Judea Pearl - 1980 - Artificial Intelligence 14 (2):113-138.
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-68866f4b87-hhxx8 uwo