- 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
Game tree searching by min/max approximation
Artificial Intelligence 34 (1):77-96 (1987)
Abstract
This article has no associated abstract. (fix it)My notes
Similar books and articles
Min-max Computation Tree Logic.Pallab Dasgupta, P. P. Chakrabarti, Jatindra Kumar Deka & Sriram Sankaranarayanan - 2001 - Artificial Intelligence 127 (1):137-162.
Using knowledge to control tree searching.David E. Wilkins - 1982 - Artificial Intelligence 18 (1):1-51.
On the nature of pathology in game searching.Judea Pearl - 1983 - Artificial Intelligence 20 (4):427-453.
Conspiracy numbers for min-max search.David Allen McAllester - 1988 - Artificial Intelligence 35 (3):287-310.
Agent searching in a tree and the optimality of iterative deepening.Pallab Dasgupta, P. P. Chakrabarti & S. C. DeSarkar - 1994 - Artificial Intelligence 71 (1):195-208.
Searching for an optimal path in a tree with random costs.Richard M. Karp & Judea Pearl - 1983 - Artificial Intelligence 21 (1-2):99-116.
Searching game trees under a partial order.Pallab Dasgupta, P. P. Chakrabarti & S. C. DeSarkar - 1996 - Artificial Intelligence 82 (1-2):237-257.
A correction to “Agent searching in a tree and the optimality of iterative deepening”.Pallab Dasgupta, P. P. Chakrabarti & S. C. DeSarkar - 1995 - Artificial Intelligence 77 (1):173-176.
Asymptotic properties of minimax trees and game-searching procedures.Judea Pearl - 1980 - Artificial Intelligence 14 (2):113-138.
Analytics
Added to PP
2020-12-22
Downloads
6 (#711,559)
6 months
5 (#1,552,255)
2020-12-22
Downloads
6 (#711,559)
6 months
5 (#1,552,255)
Historical graph of downloads
Citations of this work
Singular extensions.Thomas Anantharaman, Murray S. Campbell & Feng-Hsiung Hsu - 1990 - Artificial Intelligence 43 (1):99-109.
Mundane reasoning by settling on a plausible model.Mark Derthick - 1990 - Artificial Intelligence 46 (1-2):107-157.
Best-first minimax search.Richard E. Korf & David Maxwell Chickering - 1996 - Artificial Intelligence 84 (1-2):299-337.
A Bayesian approach to relevance in game playing.Eric B. Baum & Warren D. Smith - 1997 - Artificial Intelligence 97 (1-2):195-242.
Improving heuristic mini-max search by supervised learning.Michael Buro - 2002 - Artificial Intelligence 134 (1-2):85-99.
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.
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.
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-6686886f5-sqlzn uwo