Difference between revisions of "ITEP Chess Program"

From Chessprogramming wiki
Jump to: navigation, search
(External Links)
(Tags: Mobile edit, Mobile web edit)
Line 31: Line 31:
 
* [http://adamant1.fromru.com/kaissa.html "Каисса" - Историю программы рассказывает один из ее создателей Михаил Донской] - Kaissa by [[Mikhail Donskoy]]
 
* [http://adamant1.fromru.com/kaissa.html "Каисса" - Историю программы рассказывает один из ее создателей Михаил Донской] - Kaissa by [[Mikhail Donskoy]]
 
* [http://www.polit.ru/article/2008/08/20/programmist/ Михаил Донской: Жизненный цикл программиста - ПОЛИТ.РУ] (Russian) [[Mikhail Donskoy]] - The life cycle of a programmer, [https://www.facebook.com/politru polit.ru] August 20, 2008
 
* [http://www.polit.ru/article/2008/08/20/programmist/ Михаил Донской: Жизненный цикл программиста - ПОЛИТ.РУ] (Russian) [[Mikhail Donskoy]] - The life cycle of a programmer, [https://www.facebook.com/politru polit.ru] August 20, 2008
* The computer "plays" chess. TV news 24.11.1967, [https://en.wikipedia.org/wiki/YouTube YouTube] Video
+
* The computer "plays" chess. TV news, November 24, 1967, [https://en.wikipedia.org/wiki/YouTube YouTube] Video
 
: В шахматы "играет" ЭВМ. Телевизионные новости. Эфир 24.11.1967
 
: В шахматы "играет" ЭВМ. Телевизионные новости. Эфир 24.11.1967
 
: {{#evu:https://www.youtube.com/watch?v=LZEd6ZtSxCo|alignment=left|valignment=top}}
 
: {{#evu:https://www.youtube.com/watch?v=LZEd6ZtSxCo|alignment=left|valignment=top}}
Line 38: Line 38:
 
<references />
 
<references />
 
'''[[Engines|Up one Level]]'''
 
'''[[Engines|Up one Level]]'''
 +
[[Category:Mainframe]]
 
[[Category:Quotes]]
 
[[Category:Quotes]]
 
[[Category:Donskoy Quotes]]
 
[[Category:Donskoy Quotes]]
 +
[[Category:Videos]]

Revision as of 19:13, 18 January 2020

Home * Engines * ITEP Chess Program

The ITEP Chess Program,
an early Soviet chess program, developed since 1963 [1] at Alexander Kronrod’s laboratory at the Moscow Institute of Theoretical and Experimental Physics (ITEP) by Georgy Adelson-Velsky, Vladimir Arlazarov, Anatoly Uskov, Alexander Zhivotovsky, A. Leman, M. Rozenfeld and Russian chess master Alexander Bitman [2], to run under the Soviet M-2 [3] and M-20 computers.

Shannon Type A

The ITEP Program already was a Shannon Type A program, encouraged by Kronrod’s "general recursive search scheme", and by Alexander Brudno's description of the Alpha-Beta algorithm [4].

Stanford-ITEP

see Stanford-ITEP Match

In 1965, while John McCarthy visited the Soviet Union, he was challenged by Kronrod, who considered the Kotok-McCarthy-Program to be the best program in the United States at the time [5]. At the end of 1966 the four game match was arranged between Kotok-McCarthy, running on a IBM 7090 computer, and the ITEP Program on a M-2 [6]. The match played over nine months was won 3-1 by the ITEP Program, which searches either three (first two games) or five plies (improved version) ahead.

Kaissa

By 1971, Mikhail V. Donskoy joined with Arlazarov and Uskov to program its successor on an ICL System 4/70 at the Institute of Control Sciences, called Kaissa, which became the first World Computer Chess Champion at the WCCC 1974 in Stockholm.

Quotes

Donskoy

Quote from Mikhail Donskoy's life cycle of a programmer [7]:

When I was in high school I learned to program on the M-20 ... In the group of programmers at Institute of Theoretical and Experimental Physics, where computing work was done on nuclear physics on the M-20, they came up with arrays, lists, the need for subroutines and more. One of my teachers, Georgy Adelson-Velsky came up with a hash memory. Details can be found in another of my teachers - Alexander Kronrod "Conversations about programming". Even before Dijkstra's basic principles of structured programming was known, Alexander Brudno published the book "Programming in meaningful notation." There was also created the first chess program ... The chess program ITEP, the predecessor of Kaissa fit in memory of M-20, namely in 4096 cells, each of which has a 48-bit ...

Yershov

Quote from Biography AS Kronrod by Alexander Yershov [8]

In 1958, Kronrod, Adelson-Velsky, and Landis selected "Snap" ("подкидного дурака") as the intellectual foundations for the development of the game heuristic programming [9]. The program itself was a fiasco - but the basic principles (board games, search techniques and limited depth) were formulated. Further research laboratories in the field of game theory culminated in the first ever chess duel between the program of the Institute of Soviet and American best program developed at Stanford University under the direction of J. McCarthy. By telegraph match was played in four games ended 3-1 in favor of our institute. At the time, chess became a guinea pig for all programmers interested in artificial intelligence.

Shura-Bura

Quote from The Early Development of Programming in the USSR by Andrey Ershov and Mikhail R. Shura-Bura [10]

At the end of the 1950's a group of Moscow mathematicians began a study of computerized chess. Sixteen years later, the studies would lead to victory in the first world chess tournament for computer programs held in Stockholm during the 1974 IFIP Congress. An important component of this success was a deep study of the problems of information organization in computer memory and of various search heuristics. G. M. Adelson-Velsky and E. M. Landis invented the binary search tree ("dichotomic inquiry") and A. L. Brudno, independent of J. McCarthy, discovered the (α,β)-heuristic for reducing search times on a game tree.

See also

External Links

В шахматы "играет" ЭВМ. Телевизионные новости. Эфир 24.11.1967

References

Up one Level