Predicting the size of IDA*ʼs search tree

, &
Artificial Intelligence 196 (C):53-76 (2013)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.artint.2013.01.001

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,063

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

Monte Carlo tree search in Kriegspiel.Paolo Ciancarini & Gian Piero Favini - 2010 - Artificial Intelligence 174 (11):670-684.
A comparison of minimax tree search algorithms.Murray S. Campbell & T. A. Marsland - 1983 - Artificial Intelligence 20 (4):347-367.
The B∗ tree search algorithm—New results.Andrew J. Palay - 1982 - Artificial Intelligence 19 (2):145-163.
Some methods of controlling the tree search in chess programs.G. M. Adelson-Velskiy, V. L. Arlazarov & M. V. Donskoy - 1975 - Artificial Intelligence 6 (4):361-371.
Increasing tree search efficiency for constraint satisfaction problems.Robert M. Haralick & Gordon L. Elliott - 1980 - Artificial Intelligence 14 (3):263-313.
Predicting optimal solution costs with bidirectional stratified sampling in regular search spaces.Levi H. S. Lelis, Roni Stern, Shahab Jabbari Arfaee, Sandra Zilles, Ariel Felner & Robert C. Holte - 2016 - Artificial Intelligence 230 (C):51-73.
A crossword solving system based on Monte Carlo tree search.Jingping Liu, Lihan Chen, Sihang Jiang, Chao Wang, Sheng Zhang, Jiaqing Liang, Yanghua Xiao & Rui Song - 2024 - Artificial Intelligence 335 (C):104192.
The B∗ tree search algorithm: A best-first proof procedure.Hans Berliner - 1979 - Artificial Intelligence 12 (1):23-40.
The increasing cost tree search for optimal multi-agent pathfinding.Guni Sharon, Roni Stern, Meir Goldenberg & Ariel Felner - 2013 - Artificial Intelligence 195 (C):470-495.
A general branch and bound formulation for understanding and synthesizing and/or tree search procedures.Vipin Kumar & Laveen N. Kanal - 1983 - Artificial Intelligence 21 (1-2):179-198.

Analytics

Added to PP
2020-12-22

Downloads
11 (#1,408,134)

6 months
3 (#1,465,011)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

Depth-first iterative-deepening.Richard E. Korf - 1985 - Artificial Intelligence 27 (1):97-109.
Disjoint pattern database heuristics.Richard E. Korf & Ariel Felner - 2002 - Artificial Intelligence 134 (1-2):9-22.

Add more references