From Chessprogramming wiki
Revision as of 15:31, 10 April 2018 by GerdIsenberg (talk | contribs) (Created page with "'''Home * Engines * Kotok-McCarthy-Program''' The '''Kotok-McCarthy-Program''', also known as "A Chess Playing Program for the IBM 7090 Computer" was...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

Home * Engines * Kotok-McCarthy-Program

The Kotok-McCarthy-Program,

also known as "A Chess Playing Program for the IBM 7090 Computer" was the first computer program to play chess convincingly. Between 1959 and 1962, while student of John McCarthy at the Massachusetts Institute of Technology, Alan Kotok and his fellows Elwyn Berlekamp, Michael A. Lieberman, Charles Niessen and Robert A. Wagner wrote a chess program for the IBM 7090. Based on Alex Bernstein's 1957 program and routines by McCarthy and Paul W. Abrahams, they added alpha-beta pruning to minmax, at McCarthy's suggestion. The Kotok-McCarthy-Program was written in Fortran and FAP, the IBM 7090 macro assembler.

Type B

The program was selective Shannon Type B. It considered only a few plausible moves as function of increasing ply:

{4, 3, 2, 2, 1, 1, 1, 1, 0, 0}

and therefor had some tactical flaws.

Stanford-ITEP Match

see main article Stanford-ITEP Match

After graduated from MIT, Kotok lost interest in computer chess but his program remained alive. When McCarthy left MIT to take charge of the Artificial Intelligence Laboratory at Stanford, he took Kotok's program with him and improved it's searching. At the end of 1966 a four game match began between the Kotok-McCarthy program, running on a IBM 7090 computer, and a program developed at the Institute of Theoretical and Experimental Physics (ITEP) in Moscow which used a Soviet M-2 computer [1]. The match played over nine months was won 3-1 by the The ITEP program, despite playing on slower hardware.

See also


External Links


Up one Level