Asymptotic properties of minimax trees and game-searching procedures

Artificial Intelligence 14 (2):113-138 (1980)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,757

External links

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

Through your library

Analytics

Added to PP
2020-12-22

Downloads
32 (#713,415)

6 months
15 (#214,286)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

On the nature of pathology in game searching.Judea Pearl - 1983 - Artificial Intelligence 20 (4):427-453.
An investigation of the causes of pathology in games.Dana S. Nau - 1982 - Artificial Intelligence 19 (3):257-278.
A minimax algorithm better than alpha-beta? Yes and No.Igor Roizen & Judea Pearl - 1983 - Artificial Intelligence 21 (1-2):199-220.

View all 12 citations / Add more citations

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