Heuristic search theory: survey of recent results

Authors:
Judea Pearl
Affiliations:
Cognitive Systems Laboratory, Departments of Computer Science and Engineering Systems, University of California, Los Angeles, Los Angeles, California
Venue:
IJCAI'81 Proceedings of the 7th international joint conference on Artificial intelligence - Volume 1
Year:
1981

Citing 4
Cited 3

Principles of artificial intelligence

Principles of artificial intelligence
Experiments With Some Programs That Search Game Trees

Journal of the ACM (JACM)
The solution for the branching factor of the alpha-beta pruning algorithm and its optimality

Communications of the ACM
Performance measurement and analysis of certain search algorithms.

Performance measurement and analysis of certain search algorithms.

Pathology on game trees revisited, and an alternative to minimaxing

Artificial Intelligence
Comparing minimax and product in a variety of games

AAAI'87 Proceedings of the sixth National conference on Artificial intelligence - Volume 1
Comparing minimax and product in a variety of games

AAAI'87 Proceedings of the sixth National conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper summarizes recent analytical Investigations of the mathematical properties of heuristics and their Influence on the performance of common search techniques. The results are reported without proofs, together with discussions of motivations and Interpretations. Highlights include the following: relations between the precision of the heuristic estimates and the average complexity of the search, comparisons of the average complexities of A* and BACKTRACKING, procedures for comparing and combining non-admissible heuristic functions, the influence of the weight u (l-u)g ♦ h] on the complexity of A*, determination of the branching factors of alpha-beta and SSS*, and the effects of successor ordering on the complexity of alpha-beta and of search depth on the quality of decisions.