ITEP Chess Program

Home * Engines * ITEP Chess Program

The ITEP Chess Program, an early Soviet chess program, developed since 1963 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, to run under the Soviet M-2 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.

=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. 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. 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=

Yershov
=External Links=
 * The Fast Universal Digital Computer M-2 from Russian Virtual Computer Museum
 * GreKo - Download has a listing of the ITEP Chess Program for the M-20 computer, hosted by Vladimir Medvedev
 * "Каисса" - Историю программы рассказывает один из ее создателей Михаил Донской - Kaissa by Mikhail Donskoy
 * Михаил Донской: Жизненный цикл программиста - ПОЛИТ.РУ (Russian) Mikhail Donskoy - The life cycle of a programmer, polit.ru August 20, 2008

=References=

Up one Level