25,161
edits
Changes
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..."
'''[[Main Page|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 [[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 was selective [[Type B Strategy|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 [[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-2]] 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.
=See also=
* [[The Bernstein Chess Program]]
* [[History|History of Computer Chess]]
* [[Stanford-ITEP Match]]
* [[Mac Hack#TypeB|Type B Search in Mac Hack VI]]
=Publications=
* [[Alan Kotok]] ('''1962'''). ''[http://www.kotok.org/AI_Memo_41.html Artificial Intelligence Project - MIT Computation Center: Memo 41 - A Chess Playing Program]''. [ftp://publications.ai.mit.edu/ai-publications/pdf/AIM-041.pdf pdf]
* [[Alan Kotok]] ('''1962'''). ''A Chess Playing Program for the IBM 7090''. B.S. Thesis, [[Massachusetts Institute of Technology|MIT]], AI Project Memo 41, Computation Center, Cambridge MA. [http://www.kotok.org/AK-Thesis-1962.pdf pdf]
* [http://www.cs.toronto.edu/~brudno/ Michael Brudno] ('''2000'''). ''Competitions, Controversies, and Computer Chess'', [http://www.cs.toronto.edu/%7Ebrudno/essays/cchess.pdf pdf]
=External Links=
* [https://en.wikipedia.org/wiki/Kotok-McCarthy Kotok-McCarthy-Program from Wikipedia]
* [http://web.archive.org/web/20071221115817/http://classicchess.googlepages.com/Chess.htm Classic Computer Chess - ... The programs of yesteryear] by [[Carey Bloodworth|Carey]], hosted by the [https://en.wikipedia.org/wiki/Internet_Archive Internet Archive] <ref>[http://www.talkchess.com/forum/viewtopic.php?t=56938&start=2 Re: Old programs CHAOS and USC] by [[Dann Corbit]], [[CCC]], July 11, 2015</ref>
* [http://www.computerhistory.org/chess/main.php?sec=thm-42b86c2029762&sel=thm-42b86c7bdbaf1 Opening Moves: Origins of Computer Chess] from [[The Computer History Museum]]
=References=
<references />
'''[[Engines|Up one Level]]'''
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 [[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 was selective [[Type B Strategy|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 [[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-2]] 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.
=See also=
* [[The Bernstein Chess Program]]
* [[History|History of Computer Chess]]
* [[Stanford-ITEP Match]]
* [[Mac Hack#TypeB|Type B Search in Mac Hack VI]]
=Publications=
* [[Alan Kotok]] ('''1962'''). ''[http://www.kotok.org/AI_Memo_41.html Artificial Intelligence Project - MIT Computation Center: Memo 41 - A Chess Playing Program]''. [ftp://publications.ai.mit.edu/ai-publications/pdf/AIM-041.pdf pdf]
* [[Alan Kotok]] ('''1962'''). ''A Chess Playing Program for the IBM 7090''. B.S. Thesis, [[Massachusetts Institute of Technology|MIT]], AI Project Memo 41, Computation Center, Cambridge MA. [http://www.kotok.org/AK-Thesis-1962.pdf pdf]
* [http://www.cs.toronto.edu/~brudno/ Michael Brudno] ('''2000'''). ''Competitions, Controversies, and Computer Chess'', [http://www.cs.toronto.edu/%7Ebrudno/essays/cchess.pdf pdf]
=External Links=
* [https://en.wikipedia.org/wiki/Kotok-McCarthy Kotok-McCarthy-Program from Wikipedia]
* [http://web.archive.org/web/20071221115817/http://classicchess.googlepages.com/Chess.htm Classic Computer Chess - ... The programs of yesteryear] by [[Carey Bloodworth|Carey]], hosted by the [https://en.wikipedia.org/wiki/Internet_Archive Internet Archive] <ref>[http://www.talkchess.com/forum/viewtopic.php?t=56938&start=2 Re: Old programs CHAOS and USC] by [[Dann Corbit]], [[CCC]], July 11, 2015</ref>
* [http://www.computerhistory.org/chess/main.php?sec=thm-42b86c2029762&sel=thm-42b86c7bdbaf1 Opening Moves: Origins of Computer Chess] from [[The Computer History Museum]]
=References=
<references />
'''[[Engines|Up one Level]]'''
