A comparison of minimax tree search algorithms

Artificial Intelligence 20 (4):347-367 (1983)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,991

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Best-first minimax search.Richard E. Korf & David Maxwell Chickering - 1996 - Artificial Intelligence 84 (1-2):299-337.
Parallel Randomized Best-First Minimax Search.Yaron Shoham & Sivan Toledo - 2002 - Artificial Intelligence 137 (1-2):165-196.
Minimax real-time heuristic search.Sven Koenig - 2001 - Artificial Intelligence 129 (1-2):165-197.
On the complexity of admissible search algorithms.Alberto Martelli - 1977 - Artificial Intelligence 8 (1):1-13.
Performance of linear-space search algorithms.Weixiong Zhang & Richard E. Korf - 1995 - Artificial Intelligence 79 (2):241-292.
Monte Carlo tree search in Kriegspiel.Paolo Ciancarini & Gian Piero Favini - 2010 - Artificial Intelligence 174 (11):670-684.

Analytics

Added to PP
2020-12-22

Downloads
19 (#824,557)

6 months
8 (#416,172)

Historical graph of downloads
How can I increase my downloads?

References found in this work

An analysis of alpha-beta pruning.Donald E. Knuth & Ronald W. Moore - 1975 - Artificial Intelligence 6 (4):293-326.
A minimax algorithm better than alpha-beta?G. C. Stockman - 1979 - Artificial Intelligence 12 (2):179-196.

Add more references