Kotok-McCarthy

Last updated
From A Chess Playing Program for the IBM 7090 Computer, Alan Kotok undergraduate thesis, John McCarthy advisor, MIT 1962 Kotok thesis figure-1.png
From A Chess Playing Program for the IBM 7090 Computer, Alan Kotok undergraduate thesis, John McCarthy advisor, MIT 1962

Kotok-McCarthy also known as A Chess Playing Program for the IBM 7090 Computer was the first computer program to play chess convincingly. It is also remembered because it played in and lost the first chess match between two computer programs. A pseudocode of the program is in Figure 11.15 of. [1]

Contents

Development

Between 1959 and 1962, classmates Elwyn Berlekamp, Alan Kotok, Michael Lieberman, Charles Niessen and Robert A. Wagner wrote the program while students of John McCarthy at the Massachusetts Institute of Technology.

Building on Alex Bernstein's landmark 1957 program [2] created at IBM and on IBM 704 routines by McCarthy and Paul W. Abrahams, they added alpha-beta pruning to minmax at McCarthy's suggestion to improve the plausible move generator. They wrote in Fortran and FAP on scavenged computer time. After MIT received a 7090 from IBM, a single move took five to twenty minutes. By 1962 when they graduated, the program had completed fragments of four games at a level "comparable to an amateur with about 100 games experience". [3] Kotok, at about age 20, published their work in MIT Artificial Intelligence Memo 41 and his bachelor's thesis. [3]

Match with ITEP

In 1965, McCarthy, by then at Stanford University, visited the Soviet Union. A group using the M-2 computer at Alexander Kronrod’s laboratory at the Moscow Institute for Theoretical and Experimental Physics (ITEP) challenged him to a match. [4] Kronrod considered Kotok-McCarthy to be the best program in the United States at the time. [5] Although some of its faults were known in 1965 [6] and were corrected in the Greenblatt program at MIT Project MAC, Kotok-McCarthy was no longer in development and was three years out of date.

Georgy Adelson-Velsky, Vladimir Arlazarov, Bitman, Anatoly Uskov and Alexander Zhivotovsky won the correspondence match played by telegraph over nine months in 1966-1967. The Kotok-McCarthy program lost the match by a score of three to one [5] and the first two games were played with a weak version. [7] The ITEP group was advised by Russian chess master[ citation needed ] Alexander R. Bitman and three-time world champion Mikhail Botvinnik. [8] According to the Computer History Museum, McCarthy "used an improved version" [9] in 1967 but what improvements were made is unknown.

Influence

In 1967 Mac Hack VI [10] by Richard Greenblatt with Donald E. Eastlake III became an honorary member of the United States Chess Federation [ citation needed ] when a person lost to it in tournament play in Massachusetts. Kronrod lost his directorship at ITEP and his professorship because of complaints from physics users that ITEP mathematics resources were being used for gaming. Mikhail Donskoy, Arlazarov and Uskov developed the ITEP program into Kaissa [ citation needed ] at the Institute of Control Sciences and in 1974, it became the world computer chess champion. [11] Debate continued [12] some forty years after the first test, about whether the Shannon [13] Type A brute force approach, used by ITEP, is superior to the Type B selective strategy, used by Kotok-McCarthy. [7] The success of programs such as Northwestern University's Chess 4.5, which used the Type A strategy, [14] [15] however, led to the Type A strategy being favored, at least for projects where playing strength, and not insight into human thought processes, was the goal. [16] Recently, however, chess programs which make use of neural networks to evaluate positions, such as Giraffe, Alpha Chess Zero and Leela Chess Zero, make use of Monte Carlo Tree Search in order to allow a deeper search by not evaluating every position.

See also

Notes

  1. Newell, Allen; Simon, Herbert Alexander (2019). Human problem solving. Brattleboro, Vermont: Echo Point Books & Media. ISBN   978-1-63561-792-4.
  2. Mastering the Game: A History of Computer Chess, Computer History Museum (September 2005). "Opening Moves: Origins of Computer Chess" . Retrieved 2006-12-17.
  3. 1 2 Kotok, Alan (3 December 2004). "MIT Artificial Intelligence Memo 41" . Retrieved 2006-12-08.
  4. McCarthy, John (8 September 2005). The History of Computer Chess: An AI Perspective (Google Video). Mountain View, CA, USA: Computer History Museum. Retrieved 2006-12-08.. McCarthy begins at 0:43:48.
  5. 1 2 E.M. Landis, I.M. Yaglom, Remembering A.S. Kronrod, English translation by Viola Brudno. W. Gautschi (ed.) [written for Uspekhi Matematicheskikh Nauk, English publication Math. Intelligencer (2002), 22-30], available at Stanford University School of Engineering SCCM-00-01 Archived 2007-06-13 at the Wayback Machine (PostScript). Retrieved on 19 December 2006
  6. Greenblatt, Richard D. (12 January 2005). "Oral History of Richard Greenblatt" (PDF). Computer History Museum. Archived from the original (PDF) on 27 September 2011. Retrieved 2006-07-01.{{cite journal}}: Cite journal requires |journal= (help)
  7. 1 2 Brudno, Michael (May 2000). "Competitions, Controversies, and Computer Chess" (PDF). Retrieved 2006-12-09.{{cite journal}}: Cite journal requires |journal= (help)
  8. Gift of Monroe Newborn (photographer) (1980). "International Grandmaster and World Champion Mikhail Botvinnik in Moscow". Computer History Museum accession number 102645357. Retrieved 2006-12-24.{{cite web}}: External link in |author= (help)
  9. Photo: John McCarthy, artificial intelligence pioneer, playing chess at Stanford's IBM 7090, Unknown photographer. Courtesy of Stanford University. (1967). "Computer History Museum accession number L062302006" . Retrieved 2006-12-22.
  10. Greenblatt, Richard D., Eastlake, Donald E. III, and Crocker, Stephen D. (1969). "The Greenblatt Chess Program" (PDF). Massachusetts Institute of Technology. Archived from the original (PDF) on 2017-07-06. Retrieved 2006-07-01.{{cite journal}}: Cite journal requires |journal= (help)CS1 maint: multiple names: authors list (link)
  11. Photo: Arlazarov, Uskov, and Donskoy in Moscow, Unknown photographer. Gift of M.M. Newborn. (1980). "Computer History Museum accession number 102645411" . Retrieved 2006-12-18.
  12. Newborn, Monty (28 February 2005). "Oral History of Monty Newborn" (PDF). Computer History Museum. Retrieved 2006-12-17.{{cite journal}}: Cite journal requires |journal= (help)
  13. Shannon, Claude E. (March 1950). "Programming a Computer for Playing Chess" (PDF). Philosophical Magazine. 7th Series. 41 (314). Archived from the original (PDF) on 2010-07-06. Retrieved 2006-07-01.
  14. KORF, Richard E. (1985). "Depth-first iterative deepening" (PDF).{{cite journal}}: Cite journal requires |journal= (help)
  15. Frey, Peter W; Atkin, Larry R (October 1978). "Creating a Chess Player / An Essay on Human and Computer Chess Skill". BYTE. p. 182. Retrieved 17 October 2013.
  16. Heath, David and Allum, Derek (April 1997). "The Historical Development of Computer Chess and its Impact on Artificial Intelligence" (PDF). Retrieved 2018-11-24.{{cite journal}}: Cite journal requires |journal= (help)CS1 maint: multiple names: authors list (link)

Related Research Articles

<span class="mw-page-title-main">Deep Blue (chess computer)</span> Chess-playing computer made by IBM

Deep Blue was a chess-playing expert system run on a unique purpose-built IBM supercomputer. It was the first computer to win a game, and the first to win a match, against a reigning world champion under regular time controls. Development began in 1985 at Carnegie Mellon University under the name ChipTest. It then moved to IBM, where it was first renamed Deep Thought, then again in 1989 to Deep Blue. It first played world champion Garry Kasparov in a six-game match in 1996, where it lost four games to two. It was upgraded in 1997 and in a six-game re-match, it defeated Kasparov by winning two games and drawing three. Deep Blue's victory is considered a milestone in the history of artificial intelligence and has been the subject of several books and films.

<span class="mw-page-title-main">Computer chess</span> Computer hardware and software capable of playing chess

Computer chess includes both hardware and software capable of playing chess. Computer chess provides opportunities for players to practice even in the absence of human opponents, and also provides opportunities for analysis, entertainment and training. Computer chess applications that play at the level of a chess grandmaster or higher are available on hardware from supercomputers to smart phones. Standalone chess-playing machines are also available. Stockfish, Leela Chess Zero, GNU Chess, Fruit, and other free open source applications are available for various platforms.

<span class="mw-page-title-main">Mikhail Botvinnik</span> Soviet chess player (1911–1995)

Mikhail Moiseyevich Botvinnik was a Soviet and Russian chess grandmaster who held five world titles in three different reigns. The sixth World Chess Champion, he also worked as an electrical engineer and computer scientist and was a pioneer in computer chess. He also had a mathematics degree(honorary).

<span class="mw-page-title-main">Compatible Time-Sharing System</span> Computer operating system

The Compatible Time-Sharing System (CTSS) was the first general purpose time-sharing operating system. Compatible Time Sharing referred to time sharing which was compatible with batch processing; it could offer both time sharing and batch processing concurrently.

<span class="mw-page-title-main">John McCarthy (computer scientist)</span> American computer scientist and cognitive scientist

John McCarthy was an American computer scientist and cognitive scientist. He was one of the founders of the discipline of artificial intelligence. He co-authored the document that coined the term "artificial intelligence" (AI), developed the programming language family Lisp, significantly influenced the design of the language ALGOL, popularized time-sharing, and invented garbage collection.

<span class="mw-page-title-main">MIT Computer Science and Artificial Intelligence Laboratory</span> CS and AI Laboratory at MIT (formed by merger in 2003)

Computer Science and Artificial Intelligence Laboratory (CSAIL) is a research institute at the Massachusetts Institute of Technology (MIT) formed by the 2003 merger of the Laboratory for Computer Science (LCS) and the Artificial Intelligence Laboratory. Housed within the Ray and Maria Stata Center, CSAIL is the largest on-campus laboratory as measured by research scope and membership. It is part of the Schwarzman College of Computing but is also overseen by the MIT Vice President of Research.

<span class="mw-page-title-main">Richard Greenblatt (programmer)</span> American computer programmer (born 1944)

Richard D. Greenblatt is an American computer programmer. Along with Bill Gosper, he may be considered to have founded the hacker community, and holds a place of distinction in the communities of the programming language Lisp and of the Massachusetts Institute of Technology (MIT) Artificial Intelligence Laboratory.

<span class="mw-page-title-main">Rodney Brooks</span> Australian roboticist

Rodney Allen Brooks is an Australian roboticist, Fellow of the Australian Academy of Science, author, and robotics entrepreneur, most known for popularizing the actionist approach to robotics. He was a Panasonic Professor of Robotics at the Massachusetts Institute of Technology and former director of the MIT Computer Science and Artificial Intelligence Laboratory. He is a founder and former Chief Technical Officer of iRobot and co-Founder, Chairman and Chief Technical Officer of Rethink Robotics and currently is the co-founder and Chief Technical Officer of Robust.AI.

<span class="mw-page-title-main">Jack Dennis</span> American computer scientist

Jack Bonnell Dennis is a computer scientist and Emeritus Professor of Computer Science and Engineering at Massachusetts Institute of Technology.

Georgy Maximovich Adelson-Velsky was a Soviet and Israeli mathematician and computer scientist.

<span class="mw-page-title-main">Aleksandr Kronrod</span>

Aleksandr Semyonovich Kronrod was a Soviet mathematician and computer scientist, best known for the Gauss–Kronrod quadrature formula which he published in 1964. Earlier, he worked on computational solutions of problems emerging in theoretical physics. He is also known for his contributions to economics, specifically for proposing corrections and calculating price formation for the USSR. Later, Kronrod gave his fortune and life to medicine to care for terminal cancer patients. Kronrod is remembered for his captivating personality and was admired as a student, teacher and leader.

Mac Hack is a computer chess program written by Richard D. Greenblatt. Also known as Mac Hac and The Greenblatt Chess Program, it was developed at the Massachusetts Institute of Technology. Mac Hack VI was the first chess program to play in human tournament conditions, the first to be granted a chess rating, and the first to win against a person in tournament play. A pseudocode for the program is given in Figure 11.16 of.

<span class="mw-page-title-main">Alan Kotok</span> American computer scientist

Alan Kotok was an American computer scientist known for his work at Digital Equipment Corporation and at the World Wide Web Consortium (W3C). Steven Levy, in his book Hackers: Heroes of the Computer Revolution, describes Kotok and his classmates at the Massachusetts Institute of Technology (MIT) as the first true hackers.

Kaissa was a chess program developed in the Soviet Union in the 1960s. It was named so after Caissa, the goddess of chess. Kaissa became the first world computer chess champion in 1974 in Stockholm.

<span class="mw-page-title-main">Alexander Brudno</span> Russian computer scientist (1918–2009)

Alexander L'vovich Brudno was a Russian computer scientist, best known for fully describing the alpha-beta pruning algorithm. From 1991 until his death he lived in Israel.

T-Square is an early drafting program written by Peter Samson assisted by Alan Kotok and possibly Robert A. Saunders while they were students at the Massachusetts Institute of Technology and members of the Tech Model Railroad Club.

Nathaniel Rochester was the chief architect of the IBM 701, the first mass produced scientific computer, and of the prototype of its first commercial version, the IBM 702. He wrote the first assembler and participated in the founding of the field of artificial intelligence.

The AI Memos are a series of influential memorandums and technical reports published by the MIT AI Lab, Massachusetts Institute of Technology, United States. They cover Artificial Intelligence, a field of computer science.

<span class="mw-page-title-main">Vladimir Arlazarov</span> Russian computer scientist

Vladimir L’vovich Arlazarov (Russian: Арлазаров Владимир Львович) is a Russian computer scientist born in Moscow.

Robert Alan Saunders is an American computer scientist, most famous for being an influential computer programmer. Saunders joined the Tech Model Railroad Club (TMRC) led by Alan Kotok, Peter Samson, and himself. They then met Marvin Minsky and other influential pioneers in what was then known as Artificial Intelligence.

References

  • AIM-41 PostScript. Retrieved on 24 December 2006.
  • AIM-41 PDF. Retrieved on 24 December 2006.