25,161
edits
Changes
no edit summary
==Kaissa: The chronology of the events==
[[Timeline#1963|1963]] (1961) - beginning of the works on the first Soviet chess program in the [[Institute of Theoretical and Experimental Physics]] (ITEP) in the laboratory under [[Alexander Kronrod|Alexander Kronrod's]] management. The first authors - [[Georgy Adelson-Velsky]], [[Vladimir Arlazarov]], [[Alexander Bitman]], [[Alexander Zhivotovsky]], [[Anatoly Uskov]], A. Leman, M. Rozenfeld.
[[Timeline#1967|1967]] - first international match of chess programs. Competed the program ITEP and the program of [[Stanford University]], made under the management [[John McCarthy]]. McCarthy is famous fact that in 1952 on the beach in San Diego together with [[Alan Turing]] devised the word combination of "Artificial Intelligence", and fact that he is the author of the language Lisp - the first programming language, specially created for the tasks in the problems of artificial intelligence. Regulations of the [[Stanford-ITEP Match|match]] - four games. From the side of Stanford played one and the same version, from the ITEP side - two, which were being distinguished by the depth of search. Moves were transferred by the telegraph once a week (this to those- that times from "yadernogo" institute!). Match continued entire year and ended with the score the 3:1 in favor of ITEP.
[[Timeline#1969|1969]] (1968) - a letter in support of mathematician [https://en.wikipedia.org/wiki/Alexander_Esenin-Volpin Esenin-Volpin] (son of [https://en.wikipedia.org/wiki/Sergei_Yesenin poet]) and his incorrect psychiatric confinement, among others signed by [[Alexander Kronrod]] and [[Georgy Adelson-Velsky]]. As a result, the laboratory was disbanded and its major portion under [[Vladimir Arlazarov|Vladimir Arlazarov's]] management, but without Kronrod, after a certain time he settled in [[Institute of Control Sciences]] (ICF).
[[Timeline#1970|1970]] - the mechanic mathematical department of [[Moscow State University|MGU]] finished the entire group of the students of [[Alexander Kronrod]] and [[Georgy Adelson-Velsky]], that was being occupied in the famous seminar for discrete algorithms. Sums of the seminar:
