Changes

Jump to: navigation, search

Kotok-McCarthy-Program

1,130 bytes added, 14:27, 25 January 2020
no edit summary
'''[[Main Page|Home]] * [[Engines]] * Kotok-McCarthy-Program'''
[[File:JohnMcCarthy.jpg||border|right|thumb|300px| [[John McCarthy]] operating Kotok-McCarthy <ref>[http://www.computerhistory.org/chess/stl-431e1a07ca980/ John McCarthy, artificial intelligence pioneer, playing chess at Stanford's IBM 7090] | [http://www.computerhistory.org/chess/ Mastering the Game] | [[The '''Computer History Museum]] 1967 ca., Courtesy [[Stanford University]], [[John McCarthy]] used an improved version of the [[Kotok-McCarthy-Program'''|Kotok program]] to play correspondence chess against a [[ITEP Chess Program|Soviet program]] developed at the Moscow [[Institute of Theoretical and Experimental Physics]] (ITEP) by [[Georgy Adelson-Velsky|George Adelson-Velsky]] and others. In 1967, a [[Stanford-ITEP Match|four-game match]] played over nine months was won 3-1 by the Soviet program.</ref> <ref>[http://infolab.stanford.edu/pub/voy/museum/pictures/display/1-1.htm CSD founding faculty] from [http://infolab.stanford.edu/pub/voy/museum/phototour.html Computer History Exhibits Photo Tour] created January 2000 by [http://infolab.stanford.edu/~gio/ Gio Wiederhold]</ref> ]]
 
The '''Kotok-McCarthy-Program''', <br/>
also known as "A Chess Playing Program for the [[IBM 7090]] Computer" was the first computer program to play chess convincingly. Between 1959 and [[Timeline#1962|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 [[The Bernstein Chess Program|Alex Bernstein's 1957 program]] and routines by [[John McCarthy|McCarthy]] and [[Paul W. Abrahams]], they added [[Alpha-Beta|alpha-beta pruning]] to [[Minimax|minmax]], at McCarthy's suggestion. The Kotok-McCarthy-Program was written in [[Fortran]] and [https://en.wikipedia.org/wiki/IBM_704/9/90_FORTRAN_Assembly_Program#FORTRAN_Assembly_Program FAP], the IBM 7090 macro assembler.
=<span id="TypeB"></span>Type B=
The program Kotok-McCarthy was a selective [[Type B Strategy|Shannon Type B]]kind of program. It considered only a few plausible moves as function of increasing [[Ply|ply:]]
{4, 3, 2, 2, 1, 1, 1, 1, 0, 0}
and therefor had some tactical flaws.{{Quote Greenblatt on Kotok-McCarthy}}
=Stanford-ITEP Match=
''see main article [[Stanford-ITEP Match]]''
After graduated from [[Massachusetts Institute of Technology|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 University|Stanford]], he took Kotok's program with him and improved it's searching. At the end of 1966 a [[Stanford-ITEP Match|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-220]] computer <ref>[http://www.computer-museum.ru/english/m2.htm The Fast Universal Digital Computer M-2] by the [[Russian Virtual Computer Museum]]</ref>. The match played over nine months was won 3-1 by the The ITEP program, despite playing on slower hardware. =Quotes= {{Quote Alan Kotok}}
=See also=
=References=
<references />
 
'''[[Engines|Up one Level]]'''
[[Category:Mainframe]]
[[Category:Fortran]]
[[Category:Kotok Quotes]]

Navigation menu