Editing Computer chess (section)

==Further reading==
*[http://www.loopchess.com/fritz_reul_thesis_revision_1.pdf New Architectures in Computer Chess – Thesis on How to Build A Chess Engine]
*{{Citation|last=Coles|first=L. Stephen|title=Computer Chess: The Drosophila of AI|date=October 30, 2002|publisher=[[Dr. Dobb's Journal]]|url=http://www.ddj.com/hpc-high-performance-computing/184405171}}
*{{Citation
|last=Huberman (Liskov)|first=Barbara Jane|title=A program to play chess end games|year=1968|publisher=Stanford University Department of Computer Science, Technical Report CS 106, Stanford Artificial Intelligence Project Memo AI-65|author-link=Barbara Liskov}}
* Lasar, Matthew (2011). [https://arstechnica.com/gaming/news/2011/08/force-versus-heuristics-the-contentious-rise-of-computer-chess.ars Brute force or intelligence? The slow rise of computer chess]". ''[[Ars Technica]]''.
* Newborn, Monty (1996). ''Outsearching Kasparov'', American Mathematical Society's Proceeding of Symposia in Applied Mathematics: Mathematical Aspects of Artificial Intelligence, v. 55, pp 175–205, 1998. Based on paper presented at the 1996 Winter Meeting of the AMS, Orlando, Florida, Jan 9–11, 1996.
* Newborn, Monty (2000). ''Deep Blue's contribution to AI'', Annals of Mathematics and Artificial Intelligence, v. 28, pp.&nbsp;27–30, 2000.
* Newborn, Monty (2006). [http://www.cs.mcgill.ca/~newborn/TheoOctopusAtCasc06.pdf ''Theo and Octopus at the 2006 World Championship for Automated Reasoning Programs''], Seattle, Washington, August 18, 2006
*{{Citation|last=Stiller|first=Lewis|title=Multilinear Algebra and Chess Endgames|publisher=[[Mathematical Sciences Research Institute]], Games of No Chance, MSRI Publications, Volume 29|year=1996|location=Berkeley, California|url=http://www.msri.org/publications/books/Book29/files/stiller.pdf|access-date=21 June 2009}}