25,161
edits
Changes
no edit summary
* [[Larry Harris]] ('''1977'''). ''The heuristic search: An alternative to the alpha-beta minimax procedure.'' [[Chess Skill in Man and Machine]]
==1980 ...==
* [[Judea Pearl]] ('''1981'''). ''Heuristic search theory: A survey of recent results''. [[Conferences#IJCAI1981|IJCAI-81]], [http://ijcai.org/Past%20Proceedings/IJCAI-81-VOL%201/PDF/100.pdf pdf]* [[Judea Pearl]] ('''1984'''). ''Heuristics: Intelligent Search Strategies for Computer Problem Solving''. [https://en.wikipedia.org/wiki/Addison-Wesley Addison-Wesley]
* [[Alexander Reinefeld]], [[Tony Marsland]], [[Jonathan Schaeffer]] ('''1985'''). ''Is Best First Search Really Best?'' Technical Report TR 85-16, Department of Computer Science, [[University of Alberta]].
* [[Hermann Kaindl]], [[Helmut Horacek]], [[Marcus Wagner]] ('''1986'''). ''Selective Search versus Brute Force.'' [[ICGA Journal#9_3|ICCA Journal, Vol. 9, No. 3]]
* [[Anup K. Sen]], [[Amitava Bagchi]] ('''1989'''). ''Fast Recursive Formulations for Best-First Search that allow Controlled use of Memory''. [[Conferences#IJCAI|IJCAI 1989]], [http://www.ijcai.org/Past%20Proceedings/IJCAI-89-VOL1/PDF/047.pdf pdf]
==1990 ...==
* [[Steven Skiena]] ('''1990'''). ''Breadth-First and Depth-First Search.'' §3.2.5 in [http://www.amazon.com/exec/obidos/ASIN/0521806860/ref=nosim/weisstein-20 Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica], [https://en.wikipedia.org/wiki/Addison-WesleyAddison-Wesley]
* [[Nageshwara Rao Vempaty]], [[Vipin Kumar]], [[Richard Korf]] ('''1991'''). ''Depth-First vs Best-First Search''. [[Conferences#AAAI-91|AAAI-91]], [https://www.aaai.org/Papers/AAAI/1991/AAAI91-067.pdf pdf]
* [[Richard Korf]] ('''1993'''). ''Linear-Space Best-First Search.'' [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 62, No. 1, [http://www.aaai.org/Papers/AAAI/1992/AAAI92-082.pdf pdf]
