Changes

Jump to: navigation, search

Alan Turing

12 bytes removed, 19:07, 23 April 2018
m
no edit summary
==Could one make a machine?==
In his 1953 paper 'Chess' in [https://en.wikipedia.org/wiki/B._V._Bowden,_Baron_Bowden Bowden's] ''Faster Than Thought'' <ref>[[Alan Turing]] ('''1953'''). '''''Chess'''''. part of the collection ''Digital Computers Applied to Games''. in [https://en.wikipedia.org/wiki/B._V._Bowden,_Baron_Bowden Bertram Vivian Bowden] (editor), ''[http://www.computinghistory.org.uk/cgi-bin/sitewise.pl?act=det&p=10719 Faster Than Thought]'', a symposium on digital computing machines, reprinted 1988 in [[Computer Chess Compendium]], reprinted 2004 in Chapter 16 of [[Alan Turing]], [https://en.wikipedia.org/wiki/Jack_Copeland B. Jack Copeland] (editor) ('''2004'''). ''The Essential Turing, Seminal Writings in Computing, Logic, Philosophy, Artificial Intelligence, and Artificial Life plus The Secrets of Enigma''. [https://en.wikipedia.org/wiki/Oxford_University_Press Oxford University Press], [http://www.amazon.com/Essential-Turing-Philosophy-Artificial-Intelligence/dp/0198250800/ref=sr_1_1?s=books&ie=UTF8&qid=1324659595&sr=1-1 amazon], [http://books.google.com/books?id=RSkxnKlv1D4C&lpg=PP882&ots=VOWmiIm_lD&dq=Turochamp%2C%20chess&pg=PP881#v=onepage&q&f=true google books]</ref> , Turing asks some questions, answered and discussed them, mentioning [[Evaluation|evaluation features]], the concepts of [[Minimax|minimax strategy]], [[Selectivity|variable look-ahead]], [[Quiescence Search|quiescence]] and [[Learning|learning]]. He does not explicitly mention the name [[Turochamp]], but the 'Machine', and its [[Turochamp#TurochampGame|game versus a human]] <ref>[http://www.chessbase.de/spotlight/spotlight2.asp?id=15 Anmerkungen zur Programmierung der Turing-Engine] by [[Mathias Feist]], [[ChessBase|ChessBase Spotlights]] (German, with original article 'Chess' by Alan Turing)</ref> <ref>[https://www.stmintz.com/ccc/index.php?id=107112 Re: How did Alan Turing's program work?] by [[Frederic Friedel]], [[CCC]], April 22, 2000</ref> .
When one is asked 'Could one make a machine to play chess?', there are several possible meanings which might be given to the words. Here are a few:
* [[Alan Turing]] ('''1951'''). ''[http://www.alanturing.net/turing_archive/archive/m/m01/M01-001.html Programmers' Handbook for the Manchester Electronic Computer Mark II]''. 1st edition
* [[Alan Turing]] ('''1952'''). ''[http://www.computer50.org/kgill/mark1/progman.html Programmers' Handbook for the Manchester Electronic Computer Mark II]''. 2nd edition, revised by [http://www.informatik.uni-trier.de/%7Eley/db/indices/a-tree/b/Brooker:R=_A=.html R.A. Brooker] <ref>[http://www.computer50.org/kgill/mark1/mark1book.html Mark 1 Documents] from [http://www.computer50.org/ Computer 50 - The University of Manchester Celebrates the Birth of the Modern Computer]</ref>
* [[Alan Turing]] ('''1953'''). '''''Chess'''''. part of the collection ''Digital Computers Applied to Games''. in [https://en.wikipedia.org/wiki/B._V._Bowden,_Baron_Bowden Bertram Vivian Bowden] (editor), ''[http://www.computinghistory.org.uk/cgi-bin/sitewise.pl?act=det&p=10719 Faster Than Thought]'', a symposium on digital computing machines, reprinted 1988 in [[Computer Chess Compendium]], reprinted 2004 in Chapter 16 of ''The Essential Turing'' ... <ref>[http://www.chessbase.de/spotlight/spotlight2.asp?id=15 Anmerkungen zur Programmierung der Turing-Engine] by [[Mathias Feist]], [[ChessBase|ChessBase Spotlights]] (German, with original article 'Chess' by Alan Turing)</ref>
==1990 ...==
* [[Edward Feigenbaum]] ('''1996'''). ''How the “What“ Becomes the “How“''. [[ACM#Communications|Communications of the ACM]], Vol. 39, No. 5, [http://archive.computerhistory.org/projects/chess/related_materials/text/2-1.How_the_what_becomes_the_how.Feigenbaum/2-1.How_the_what_becomes_the_how.Feigenbaum-Ed.1994.ACM.062303006.pdf pdf] hosted by [[The Computer History Museum]]

Navigation menu