This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Some Recent Results in Heuristic Search Theory
January 1984 (vol. 6 no. 1)
pp. 1-13
Judea Pearl, Cognitive Systems Laboratory, Department of Computer Science, University of California, Los Angeles, CA 90024; Department of Business Administration, University of Tel-Aviv, Ramat-
The 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. The highlights include the following: the optimality of A*; 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 nonadmissible heuristic functions; the influence of the weight w (in f = (l - w) g + wh) on the complexity of A*; the pruning power of alphabeta, SSS*, and SCOUT; the effect of successor ordering on search complexity, and the effect of search depth of the quality of decisions in game-playing.
Citation:
Judea Pearl, "Some Recent Results in Heuristic Search Theory," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 6, no. 1, pp. 1-13, Jan. 1984, doi:10.1109/TPAMI.1984.4767470
Usage of this product signifies your acceptance of the Terms of Use.