The B∗ tree search algorithm: A best-first proof procedure

Artificial Intelligence 12 (1):23-40 (1979)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



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

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

The B∗ tree search algorithm—New results.Andrew J. Palay - 1982 - Artificial Intelligence 19 (2):145-163.
Best-first minimax search.Richard E. Korf & David Maxwell Chickering - 1996 - Artificial Intelligence 84 (1-2):299-337.
Linear-space best-first search.Richard E. Korf - 1993 - Artificial Intelligence 62 (1):41-78.
Parallel Randomized Best-First Minimax Search.Yaron Shoham & Sivan Toledo - 2002 - Artificial Intelligence 137 (1-2):165-196.
A generalised quiescence search algorithm.Don F. Beal - 1990 - Artificial Intelligence 43 (1):85-98.
BIDA∗: an improved perimeter search algorithm.Giovanni Manzini - 1995 - Artificial Intelligence 75 (2):347-360.
A heuristic search algorithm with modifiable estimate.László Mérõ - 1984 - Artificial Intelligence 23 (1):13-27.

Analytics

Added to PP
2020-12-22

Downloads
7 (#1,411,318)

6 months
2 (#1,259,303)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Wrappers for feature subset selection.Ron Kohavi & George H. John - 1997 - Artificial Intelligence 97 (1-2):273-324.
Conspiracy numbers for min-max search.David Allen McAllester - 1988 - Artificial Intelligence 35 (3):287-310.
A generalised quiescence search algorithm.Don F. Beal - 1990 - Artificial Intelligence 43 (1):85-98.

View all 25 citations / Add more citations

References found in this work

The heuristic search under conditions of error.Larry R. Harris - 1974 - Artificial Intelligence 5 (3):217-234.

Add more references