Jump to: navigation, search

Georgy Adelson-Velsky

823 bytes removed, 17:06, 21 March 2021
Official Information
=Computer Chess=
Since the late 50s, at Kronrod's [[Institute of Theoretical and Experimental Physics]], Georgy Adelson-Velsky worked along with Kronrod, [[Alexander Brudno]], [ Mikhail Bongard], Evgenii Landis, [ Nikolay Konstantinov], [[Vladimir Arlazarov]] et al. on heuristic and game programming, where they elaborated on the foundations of computer chess. Since [[Timeline#19631913|19631961]] <ref>[ История компьютерных игр. Виртуальный компьютерный музей. Англо-Русский компьютерный словарь. Вычисления в докомпьютерную эпоху. Технологии. Компьютерные игры. История развития электросвязи. История развития ПО. История вычислительной техники в России и за рубежом] 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>[ 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>[ The Fast Universal Digital Computer M-2] from the [[Russian Virtual Computer Museum20]]</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, [ Urgench], 1979 (?) <ref>[http|gallery%2Fphotos |photo|350356 Photos of Georgy M Adelson-Velsky (1922 - 2014) -], shared by: [ Семен Карпенко], June 01, 2014</ref>
==Official Information==
by [[Mikhail Donskoy]] (1999) on [[Kaissa]] <ref>[http История “Каиссы” Михаил Донской] from [[Russian Virtual Computer Museum]] (no longer available) translated with the help of [ Babel Fish] and [ 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 [ 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 [ 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, [ network planning] and [[Artificial Intelligence|artificial intelligence]]. He now lives in Israel and works at [ Technion] on [ NP problems of complete tasks].
Quotes by [[Mikhail Donskoy]] on the [[Kaissa#HistoryofKaissa|History of Kaissa]] <ref>[ "Каисса" - Историю программы рассказывает один из ее создателей Михаил Донской] - [ Kaissa] by [[Mikhail Donskoy]], translated by [ Google Translate]</ref>
[[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 [ Esenin-Volpin] (son of [ 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:
=See also=
* [[ITEP Chess Program#Video|ITEP Chess Program Video, 1967]]
* [[Kaissa#HistoryofKaissa|History of Kaissa]]
<ref>[ Персоналии: Адельсон-Вельский Г М]</ref> <ref>[ zbMATH - Adelson-Velsky, George M.]</ref> <ref>[ dblp: Georgii M. Adelson-Velsky]</ref> <ref>[ dblp: G. M. Adelson-Velskiy]</ref>
==1945 ...==
* [[Georgy Adelson-Velsky]], [[Alexander Kronrod]] ('''1945'''). ''On a direct proof of the analyticity of a monigenic function''. (Russian) [ Doklady Akademii Nauk], Vol. 50* [[Georgy Adelson-Velsky]], [[Alexander Kronrod]] ('''1945'''). ''On the level of continuous fuctions possessing partial derivatives''. (Russian) [ Doklady Akademii Nauk], Vol. 50* [[Georgy Adelson-Velsky]], [[Alexander Kronrod]] ('''1945'''). ''On the maximum principle for an elliptic system''. (Russian) [ Doklady Akademii Nauk], Vol. 50
==1950 ...==
* [[Georgy Adelson-Velsky]], [ Yuli A. Shreider] ('''1957'''). ''[ The Banach mean on groups]''. [ Uspekhi Matematicheskikh Nauk], Vol. 12, No. 6
==1960 ...==
* [[Georgy Adelson-Velsky]], [[Mathematician#Landis|Evgenii Landis]] ('''1962'''). ''[ An algorithm for the organization of information]''. [ Proceedings of the USSR Academy of Sciences], 146: 263–266. (Russian) English translation by Myron J. Ricci in [ Soviet Mathematics Doklady], No. 3 <ref>[ AVL tree from Wikipedia]</ref>* [[Georgy Adelson-Velsky]], [[Alexander Brudno]], [[Alexander Kronrod]], Pavel T. Reznikovsky ('''1964'''). ''[ A system of commands for a three-address machine without address register]''. [ Doklady Akademii Nauk], Vol. 154, No. 3
==1970 ...==
* [[Georgy Adelson-Velsky]], [[Vladimir Arlazarov]], [[Alexander Bitman]], [[Alexander Zhivotovsky]], [[Anatoly Uskov]] ('''1970'''). ''[ Programming a Computer to Play Chess]''. [ Russian Mathematical Surveys, Vol. 25], pp. 221-262.* [[Georgy Adelson-Velsky]], [[Vladimir Arlazarov]], [[Mikhail Donskoy]] ('''1975'''). ''Some Methods of Controlling the Tree Search in Chess Programs''. [ Artificial Intelligence], Vol. 6, No. 4, Reprinted ('''1988''') in [[Computer Chess Compendium]] <ref>[ Method of Analogies??] by Bruce Cleaver, [[CCC]], May 29, 1998</ref>* [[Georgy Adelson-Velsky]], [[Vladimir Arlazarov]], [[Mikhail Donskoy]] ('''1977'''). ''On the Structure of an Important Class of Exhaustive Problems and Methods of Search Reduction for them''. [[Advances in Computer Chess 1]]* [[Georgy Adelson-Velsky]], [[Vladimir Arlazarov]], [[Mikhail Donskoy]] ('''1979'''). ''Algorithms of adaptive search''. [ Machine Intelligence 9] (eds. [[Jean Hayes Michie]], [[Donald Michie]] and L.I. Mikulich), pp. 373-384. Ellis Horwood, Chichester
==1980 ...==
* [[Georgy Adelson-Velsky]], [ V. P. Akimov], [[Vladimir Arlazarov]] ('''1981'''). ''[ On a probabilistic approach tо verification of the Shannon game model]''. [ Avtomatika i Telemekhanika], No. 9, 138–144
* Г.М. Адельсон-Вельский, [[Vladimir Arlazarov|В.Л. Арлазаров]], [[Alexander Bitman|А.Р. Битман]], [[Mikhail Donskoy|М.В. Донской]] ('''1983'''). ''Машина играет в шахматы''. [ pdf] (book with detailed explanations of Kaissa algorithms, language: Russian)
* [[Georgy Adelson-Velsky]], [|V. P. Akimov]] ('''1987'''). ''[ On validity of Shannon's game model]''. [ Avtomatika i Telemekhanika], No. 1, 171–173* [[Georgy Adelson-Velsky]], [[Vladimir Arlazarov]], [[Mikhail Donskoy]] ('''1988'''). ''[ Algorithms for Games]''. [ Springer], New York, NY. ISBN 3-540-96629-3. []
==2000 ...==
* [[Georgy Adelson-Velsky]], [ Eugene Levner] ('''2002'''). ''[ Project scheduling in AND-OR graphs: a generalization of Dijkstra’s algorithm]''. [ Mathematics of Operations Research], Vol. 27, No. 3
=Forum Posts=
* [ Photos of Georgy M Adelson-Velsky (1922 - 2014) -]
* [ Памяти Г. М. Адельсон-Вельского | Facebook]
* [ Georgy Maksimovich Adelson-Velsky (obituary)]
* [ Истинно свободный человек]
* [ Чтобы знали и помнили!]
* Адельсон Вельский Г.М. рассказывает 2002 год, [ YouTube] Video
: {{#evu:|alignment=left|valignment=top}}
'''[[People|Up one level]]'''
[[Category:Chess Programmer|Adelson-Velsky]]
[[Category:Donskoy Quotes|Adelson-Velsky]]

Navigation menu