References
Barr, Avron and Edward A. Feigenbaum, The Handbook of Artificial Intelligence. William Kaufmann, Inc., 1981.
Berlekamp, Elwyn and David Wolfe, Mathematical Go: Chilling Gets the Last Point. A. K. Peters Ltd., May 1997.
Botea, A., M. Müller, and J. Schaeffer, "Near Optimal Hierarchical Path-finding," Journal of Game Development, 1(1), 2004, http://www.jogd.com/Vol1issue1.html.
Hartmann, Sonke, Project Scheduling Under Limited Resources: Models, Methods, and Applications. Springer, 1999.
Kaindl, Hermann and Gerhard Kainz, "Bidirectional Heuristic Search Reconsidered," Journal of Artificial Intelligence Research, Volume 7: 283–317, 1997.
Korf, Richard E., "Depth-First Iterative-Deepening: An Optimal Admissible Tree Search," Artificial Intelligence, Volume 27: 97–109, 1985, http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.91.288.
Korf, Richard E., "Recent Progress in the Design and Analysis of Admissible Heuristic Functions," Proceedings, Abstraction, Reformulation, and Approximation: 4th International Symposium (SARA), Lecture notes in Computer Science #1864: 45–51, 2000.
Laramée, François Dominic, "Chess Programming Part IV: Basic Search," GameDev.net, August 26, 2000, http://www.gamedev.net/reference/articles/article1171.asp.
Michalewicz, Zbigniew and David B. Fogel, How to Solve It: Modern Heuristics, Second Edition. Springer, 2004.
Nilsson, Nils, Problem-Solving Methods in Artificial Intelligence. McGraw-Hill, 1971.
Parberry, Ian, "A Real-Time Algorithm for the (n2−1)-Puzzle," ...
Get Algorithms in a Nutshell now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
