Difference between revisions of "Paul W. Abrahams"

From Chessprogramming wiki
Jump to: navigation, search
 
Line 6: Line 6:
 
=Computer Chess=
 
=Computer Chess=
 
==Mate-in-two==
 
==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>:
+
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]''.</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.   
 
  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.   
  
Line 32: Line 32:
 
* [[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]
 
* [[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 ...==
 
==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]
+
* [http://www.cbi.umn.edu/about/norberg.html Arthur Norberg] ('''2007'''). ''[http://portal.acm.org/citation.cfm?id=1380529 Paul W. Abrahams Interview]''.  
  
 
=External Links=
 
=External Links=

Latest revision as of 18:40, 1 October 2018

Home * People * Paul W. Abrahams

Paul W. Abrahams,
an American mathematician, consulting computer scientist, and past president of the Association for Computing Machinery. Paul W. Abrahams received a bachelor's degree in mathematics in 1956, and a Ph.D. in mathematics in 1963 on Machine Verification of Mathematical Proof, both from Massachusetts Institute of Technology, studying artificial intelligence under Marvin Minsky and John McCarthy. He is one of the designers of the first Lisp system and also the designer of the CIMS PL/I system.

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 McCarthy — on a chess program [1]:

And I also met Claude Shannon and was working with him and McCarthy — on a chess program. It calculated two-move mates and was written in FORTRAN. That was also the time that FORTRAN was starting to hit the world.  

Kotok-McCarthy

Paul W. Abrahams' routines were used in the Kotok-McCarthy-Program, as mentioned in Alan Kotok's memo and thesis about the program [2] [3]:

In the fall of 1960 the chess group, without Mr. Berlekamp, began planning for the general chess program. It was decided to retain the original McCarthy/Abrahams move routines, and to continue coding in FORTRAN  and FAP. The program was to be a variable depth search with a "stable position" termination. An evaluation was to be made at the terminal points of the move tree. This evaluation would be a weighted sum of such criteria as material balance, center control, pawn structure, "tempo" advantage, and development. 

Selected Publications

[4]

1960 ...

1970 ...

1980 ...

1990 ...

2000 ...

External Links

References

Up one level