25,161
edits
Changes
no edit summary
=Computer Chess=
==Mate-in-two==
In the 2007 interview with Arthur Norberg, Abrahams mentioned that he met [[Claude Shannon]] and was working with him and [[John McCarthy|McCarthy]] — on a chess program <ref>[http://www.cbi.umn.edu/about/norberg.html Arthur Norberg] ('''2007'''). ''[http://portal.acm.org/citation.cfm?id=1380529 Paul W. Abrahams Interview]''. [http://delivery.acm.org/10.1145/1390000/1380529/paul_abrahams_interview.pdf?ip=195.50.166.189&id=1380529&acc=OPEN&key=4D4702B0C3E38B35%2E4D4702B0C3E38B35%2E4D4702B0C3E38B35%2E6D218144511F3437&__acm__=1538400928_bf0a908290a208fb710a95ad056fc14e pdf]</ref>:
And I also met [[Claude Shannon]] and was working with him and [[John McCarthy|McCarthy]] — on a chess program. It calculated two-move mates and was written in [[Fortran|FORTRAN]]. That was also the time that FORTRAN was starting to hit the world.
* [[Paul W. Abrahams]], [http://www.informit.com/authors/bio.aspx?a=3df2119c-f10e-412e-a1ea-5d5e030eb8d4 Bruce R. Larson] ('''1996'''). ''Unix for the Impatient''. [https://en.wikipedia.org/wiki/Addison-Wesley Addison-Wesley], ISBN 0-201-82376-4, [http://books.google.com/books/about/Unix_for_the_impatient.html?id=kqJVAAAAMAAJ google], [http://www.amazon.com/UNIX-Impatient-2nd-Paul-Abrahams/dp/0201823764 amozon]
==2000 ...==
* [http://www.cbi.umn.edu/about/norberg.html Arthur Norberg] ('''2007'''). ''[http://portal.acm.org/citation.cfm?id=1380529 Paul W. Abrahams Interview]''. [http://delivery.acm.org/10.1145/1390000/1380529/paul_abrahams_interview.pdf?ip=195.50.166.189&id=1380529&acc=OPEN&key=4D4702B0C3E38B35%2E4D4702B0C3E38B35%2E4D4702B0C3E38B35%2E6D218144511F3437&__acm__=1538400928_bf0a908290a208fb710a95ad056fc14e pdf]
=External Links=
