参考文献

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(n²-1)-Puzzle,"Information Processing Letters,Volume 56:23-28,1995,http://www.eng.unt.edu/ian/pubs/saml.pdf.

Pearl,Judea,Heuristics:Intelligent Search Strategies for Computer Problem Solving.Addison-Wesley,1984.

Pepicelli,Glen,"Bitwise Optimization in Java:Bitfields,Bitboards,and Beyond,"O'Reilly on Java.com,February 2,2005,http://www.onjava.com/pub/a/onjava/2005/02/02/bitsets.html.

Reinefeld,Alexander,"Complete Solution of the Eight-Puzzle and the Benefit of Node Ordering in IDA*,"Proceedings of the 13th International Joint Conference on Artificial Intelligence(IJCAI),Volume 1,1993,http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.40.9889.

Reinefeld,Alexander and T.Anthony Marsland,"Enhanced Iterative-Deepening Search,"IEEE Transactions on Pattern Analysis and Machine Intelligence,16(7):701-710,1994.http://citeseer.ist.psu.edu/article/reinefeld94enhanced.html.

Russel,Stuart,"Efficient memory-bounded search methods,"Proceedings,10th European Conference on Artificial Intelligence(ECAI):1-5,1992.

Russell,S.J.and P.Norvig,Artificial Intelligence:A Modern Approach.Prentice Hall,2003.Samuel,Arthur,"Some Studies in Machine Learning Using the Game of Checkers,"IBM Journal 3(3):210-229,http://www.research.ibm.com/journal/rd/033/ibmrd0303B.pdf.

Schaeffer,Jonathan,"Game Over:Black to Play and Draw in Checkers,"Journal of the International Computer Games Association(ICGA),http://www.cs.unimaas.nl/icga/journal/contents/Schaeffer07-01-08.pdf.

Schaeffer,Jonathan,Neil Burch,Yngvi Björnsson,Akihiro Kishimoto,Martin Müller,Robert Lake,Paul Lu,and Steve Sutphen,"Checkers is Solved,"Science Magazine,

September 14,2007,317(5844):1518-1522,http://www.sciencemag.org/cgi/content/abstract/317/5844/1518.

Shannon,Claude,"Programming a Computer for Playing Chess,"Philosophical Magazine,41(314),1950,http://tinyurl.com/ChessShannon-pdf.

Wichmann,Daniel R.and Burkhard C.Wuensche,"Automated Route Finding on Digital Terrains,"Proceedings of IVCNZ,Akaroa,New Zealand,pp.107-112,November 2004,http://www.cs.auckland.ac.nz/~burkhard/Publications/IVCNZ04_WichmannWuensche.pdf.