Judea Pearl and the work on analyzing A* and Minmax search algorithms..

[Subbarao Kambhampati <rao@asu.edu>]

If you look at the link

http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/p/Pearl:Judea.html

you will see all the papers of Judea Pearl from 1975 onwards until now. If 
you look at the titles of the
papers between 1980 and 1985, you see that he has done a lot of work on 
analyzing A* search and Minmax algorithms.


The entry number 17 is the paper which analyzes the effect of going deeper 
in gametrees (in light of the Dana Nau paper showing that game tree
pathology exists), and show that if we assume a fair number of traps exist, 
then the pathology goes away..

Rao


ps: "DBLP" is a good bibiliography for database and AI papers. A more 
exhaustive bibliography search engine is of course "bibfinder" (to get the 
URLs, type the words to Google)