Since the late 50s, at Kronrod's [[Institute of Theoretical and Experimental Physics]], Georgy Adelson-Velsky worked along with Kronrod, [[Alexander Brudno]], [https://en.wikipedia.org/wiki/Bongard_problem Mikhail Bongard], Evgenii Landis, [https://en.wikipedia.org/wiki/Nikolay_Konstantinov Nikolay Konstantinov], [[Vladimir Arlazarov]] et al. on heuristic and game programming, where they elaborated on the foundations of computer chess. Since [[Timeline#
1963| 1963]] <ref>[http://www.computer-museum.ru/games/donchess.htm История компьютерных игр. Виртуальный компьютерный музей. Англо-Русский компьютерный словарь. Вычисления в докомпьютерную эпоху. Технологии. Компьютерные игры. История развития электросвязи. История развития ПО. История вычислительной техники в России и за рубежом] from the [[Russian Virtual Computer Museum]]</ref> at ITEP, Georgy Adelson-Velsky co-developed the [[ITEP Chess Program]], along with [[Vladimir Arlazarov]], [[Anatoly Uskov]] and [[Alexander Zhivotovsky]], advised by Russian chess master [[Alexander Bitman]] and three-time world champion [[Mikhail Botvinnik]] <ref>[http://www.computerhistory.org/chess/full_record. php?iid=stl-430b9bbdb9817 International Grandmaster and World Champion Mikhail Botvinnik in Moscow], 1980, Gift of [[Monroe Newborn]], "[[Mikhail Botvinnik|Botvinnik]] served as a consultant to Soviet computer chess developers who developed an early program at [[Institute of Theoretical and Experimental Physics|ITEP]] which won a [[Stanford-ITEP Match|correspondence chess match]] against a [[Stanford University]] [[Kotok-McCarthy-Program|chess program]] led by [[John McCarthy]] in 1967. Later he advised the team that created the chess program [[Kaissa]] at [[Institute of Control Sciences|Moscow’s Institute for Control Science]]"</ref>. 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 the [[ITEP Chess Program]] on a Soviet [[M- 2]] <ref>[http://www.computer-museum.ru/english/m2.htm The Fast Universal Digital Computer M-2] from the [[Russian Virtual Computer Museum]] </ref> computer. The match played over nine months was won 3-1 by the ITEP program. In 1971, along with [[Mikhail Donskoy]] and [[Vladimir Arlazarov]], Georgy Adelson-Velsky became primary author of [[Kaissa]], winner of the [[WCCC 1974|first computer chess championship]] 1974 in Stockholm.
Georgy Adelson-Velsky and [[John McCarthy]] playing chess, Soviet-American computer science conference, [https://en.wikipedia.org/wiki/Urgench Urgench], 1979 <ref>[
http://www.forevermissed.com/georgy-m-adelson-velsky/gallery#gallery %2Fphotos Photos of Georgy M Adelson-Velsky (1922 - 2014) - ForeverMissed.com], shared by: [http://iitp.ru/en/users/189.htm Семен Карпенко], June 01, 2014</ref>
by [[Mikhail Donskoy]] (1999) on [[Kaissa]] <ref>[
http://www.computer-museum.ru/ histsoft/kaissa1.htm История “Каиссы” Михаил Донской] from [[Russian Virtual Computer Museum] ] (no longer available) translated with the help of [https://en.wikipedia.org/wiki/Babel_Fish_%28website%29 Babel Fish] and [http://www.online-translator.com/text_Translation.aspx promt translator]</ref>
Georgy Adelson-Velsky - one of the first Soviet programmers (together with [[Alexander Kronrod]], [[Alexander Brudno]], [[Mathematician#Landis|Evgenii Landis]] and others). He was occupied by the programs, connected with [https://en.wikipedia.org/wiki/Nuclear_physics nuclear physics] at [[Institute of Theoretical and Experimental Physics|ITEP]], where he devised many algorithms which became classical. Especially the equilibrium binary trees, which in the entire world are called [https://en.wikipedia.org/wiki/AVL_tree AVL trees] after the names of the authors - Adelson-Velsky and Landis. After short-term teaching at [[Moscow State University|MGU]] he worked at IPU and VNIISI (All-Union Scientific Research Institute of Sanitary Testing) on discrete algorithms, [https://en.wikipedia.org/wiki/Network_planning_and_design network planning] and [[Artificial Intelligence|artificial intelligence]]. He now lives in Israel and works at [https://en.wikipedia.org/wiki/Technion_%E2%80%93_Israel_Institute_of_Technology Technion] on [https://en.wikipedia.org/wiki/NP_%28complexity%29 NP problems of complete tasks].
Quotes by [[Mikhail Donskoy]] on the [[Kaissa#HistoryofKaissa|History of Kaissa]] <ref>[http://adamant1.fromru.com/kaissa.html "Каисса" - Историю программы рассказывает один из ее создателей Михаил Донской] - [http://translate.google.com/translate?sl=ru&tl=en&js=n&prev=_t&hl=en&ie=UTF-8&u=http%3A%2F%2Fadamant1.fromru.com%2Fkaissa.html Kaissa] by [[Mikhail Donskoy]], translated by [https://en.wikipedia.org/wiki/Google_Translate Google Translate]</ref>
[[Timeline#1963|1963]] - 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]] - 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:
* [[ITEP Chess Program#Video|ITEP Chess Program Video,
* [[Kaissa#HistoryofKaissa|History of Kaissa]]
* [http://www.forevermissed.com/georgy-m-adelson-velsky/gallery#gallery%2Fphotos Photos of Georgy M Adelson-Velsky (1922 - 2014) - ForeverMissed.com]
* [https://www.facebook.com/AdelsonVelsky Памяти Г. М. Адельсон-Вельского | Facebook]
* Адельсон Вельский Г.М. рассказывает 2002 год, [https://en.wikipedia.org/wiki/YouTube YouTube] Video