Algorithms in a Nutshell

References | 225

Path Finding

in AI

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 Journal3(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.

Algorithms in a Nutshell
Algorithms in a Nutshell By Gary Pollice, George T. Heineman, Stanley Selkow ISBN:
9780596516246 Publisher: O'Reilly Media, Inc.

Prepared for Ming Yi, Safari ID: [email protected]
Licensed by Ming Yi
Print Publication Date: 2008/10/21 User number: 594243
© 2009 Safari Books Online, LLC. This PDF is made available for personal use only during the relevant subscription term, subject to the Safari Terms of Service. Any other use