Searching game trees under a partial order

Artificial Intelligence 82 (1-2):237-257 (1996)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,069

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

On the nature of pathology in game searching.Judea Pearl - 1983 - Artificial Intelligence 20 (4):427-453.
Game tree searching by min/max approximation.Ronald L. Rivest - 1987 - Artificial Intelligence 34 (1):77-96.
The rudin–keisler ordering of p-points under ???? = ????Andrzej Starosolski - 2021 - Journal of Symbolic Logic 86 (4):1691-1705.
Partial-order planning.Anthony Barrett & Daniel S. Weld - 1994 - Artificial Intelligence 67 (1):71-112.

Analytics

Added to PP
2020-12-22

Downloads
9 (#1,281,245)

6 months
5 (#710,385)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

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.
Multi-player alpha-beta pruning.Richard E. Korf - 1991 - Artificial Intelligence 48 (1):99-111.

Add more references