Partial order bounding: A new approach to evaluation in game tree search

Artificial Intelligence 129 (1-2):279-311 (2001)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/s0004-3702(01)00085-6

Links

PhilArchive



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

External links

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

Through your library

My notes

Similar books and articles

A Theory of Heuristic Information in Game-tree Search.Chun-Hung Tzeng - 1988 - Springer.
Failure driven dynamic search control for partial order planners: an explanation based approach.Subbarao Kambhampati, Suresh Katukam & Yong Qu - 1996 - Artificial Intelligence 88 (1-2):253-315.
Searching game trees under a partial order.Pallab Dasgupta, P. P. Chakrabarti & S. C. DeSarkar - 1996 - Artificial Intelligence 82 (1-2):237-257.
The B∗ tree search algorithm—New results.Andrew J. Palay - 1982 - Artificial Intelligence 19 (2):145-163.
New local search methods for partial MaxSAT.Shaowei Cai, Chuan Luo, Jinkun Lin & Kaile Su - 2016 - Artificial Intelligence 240 (C):1-18.
Planning as refinement search: a unified framework for evaluating design tradeoffs in partial-order planning.Subbarao Kambhampati, Craig A. Knoblock & Qiang Yang - 1995 - Artificial Intelligence 76 (1-2):167-238.
Determining the consistency of partial tree descriptions.Manuel Bodirsky & Martin Kutz - 2007 - Artificial Intelligence 171 (2-3):185-196.
Graph search methods for non-order-preserving evaluation functions: applications to job sequencing problems.Anup K. Sen & Amitava Bagchi - 1996 - Artificial Intelligence 86 (1):43-73.
Game tree searching by min/max approximation.Ronald L. Rivest - 1987 - Artificial Intelligence 34 (1):77-96.
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
7 (#603,698)

6 months
6 (#1,472,471)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Computer Go.Martin Müller - 2002 - Artificial Intelligence 134 (1-2):145-179.

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 Bayesian approach to relevance in game playing.Eric B. Baum & Warren D. Smith - 1997 - Artificial Intelligence 97 (1-2):195-242.

View all 6 references / Add more references