Paul W. Abrahams contributed to the Kotok-McCarthy-Program, as mentioned in Alan Kotok's memo and thesis about the program ^{[1]}^{[2]}:

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.

## Table of Contents

Home * People * Paul W. AbrahamsPaul 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.## Kotok-McCarthy

Paul W. Abrahams contributed to the Kotok-McCarthy-Program, as mentioned in Alan Kotok's memo and thesis about the program^{[1]}^{[2]}: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

^{[3]}1962)LISP 1.5 Programmer's Manual. The M.I.T. Press, second edition (1985) as pdf^{[4]}1963).Machine Verification of Mathematical Proof. Ph.D. Thesis in Mathematics, Massachusetts Institute of Technology, Cambridge, Massachusetts1966).A final solution to the Dangling else of ALGOL 60 and related languages. Communications of the ACM Vol. 9, No. 91968).Symbol Manipulation Languages. Advances in Computers 91974).Some Remarks on Lookup of Structured Variables. Communications of the ACM Vol. 17, No. 41979).The CIMS PL/I compiler. SIGPLAN Symposium on Compiler Construction1988).Some sad remarks about string handling in C. SIGPLAN Notices Vol. 23, No. 101988).The Strategic Defense Initiative - President's Letter. Communications of the ACM Vol. 31, No. 61990).TEX for the Impatient. Addison-Wesley, ISBN 0-201-51375-7, pdf, google, amazon^{[5]}1993).Typographical Extensions for Programming Languages: Breaking out of the ASCII Straitjacket. SIGPLAN Notices 28(2)1996).Unix for the Impatient. Addison-Wesley, ISBN 0-201-82376-4, google, amozon2007).Paul W. Abrahams Interview. pdf## External Links

## References

1962).Artificial Intelligence Project - MIT Computation Center: Memo 41 - A Chess Playing Program. pdf1962).A Chess Playing Program for the IBM 7090. B.S. Thesis, MIT, AI Project Memo 41, Computation Center, Cambridge MA. pdf## What links here?

Up one level