Georgy Adelson-Velsky

Home * People * Georgy Adelson-Velsky

Georgy Maximovich Adelson-Velsky, (Гео́ргий Макси́мович Адельсо́н-Ве́льский, January 8, 1922 - April 26, 2014)

was a Soviet and Israeli mathematician, computer scientist and computer chess pioneer, most famous for inventing the AVL tree along with Evgenii Landis, and as co-author of the ITEP Chess Program and Kaissa. Adelson-Velsky and his fellow Alexander Kronrod were the last students of Nikolai Luzin at Moscow State University, where he graduated in 1949 under Israel Gelfand on Spectral Analysis of Ring of Bounded Linear Operators.

In the 90s, Adelson-Velsky emigrated to Israel and lived in Ashdod, at times affiliated with the Technion, and Mathematics & Computer Science department of Bar-Ilan University. Georgy Adelson-Velsky died on April 26, 2014, aged 92, in Givatayim, Israel.

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

At the end of 1966 a 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 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 first computer chess championship 1974 in Stockholm.

=Photos= Georgy Adelson-Velsky and John McCarthy playing chess, Soviet-American computer science conference, Urgench, 1979

Adelson-Velsky explaining his work on the analysis of the Minimax algorithm, Moscow 1980

=Quotes=

Official Information
by Mikhail Donskoy (1999) on Kaissa

Georgy Adelson-Velsky - one of the first Soviet programmers (together with Alexander Kronrod, Alexander Brudno, Evgenii Landis and others). He was occupied by the programs, connected with nuclear physics at 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 MGU he worked at IPU and VNIISI (All-Union Scientific Research Institute of Sanitary Testing) on discrete algorithms, network planning and artificial intelligence. He now lives in Israel and works at Technion on NP problems of complete tasks.

Dinitz
Anecdote by Yefim Dinitz from his talk at Shimon Even's retiring party, November 2003, revised version in Dinitz' Algorithm: The Original Version and Even's Version :

The following anecdote sheds some light on how things were done in the USSR. Shortly after the "iron curtain" fell in 1990, an American and a Russian, who had both worked on the development of weapons, met. The American asked: "When you developed the Bomb, how were you able to perform such an enormous amount of computing with your weak computers?". The Russian responded: "We used better algorithms."

This was really so. Russia had a long tradition of excellence in Mathematics. In addition, the usual Soviet method for attacking hard problems was to combine pressure from the authorities with people's enthusiasm. When Stalin decided to develop the Bomb, many bright mathematicians, e.g. Israel Gelfand and my first Math teacher, Alexander Kronrod, put aside their mathematical studies and delved deeply into the novel area of computing. They have assembled teams of talented people, and succeeded. The teams continued to grow and work on the theory of computing.

The supervisor of my M.Sc. thesis was Georgy Adelson-Velsky, one of the fathers of Computer Science. Among the students in his group were M. Kronrod (one of the future "Four Russians", i.e. the four authors of ), A. Karzanov (the future author of the O(n3) network flow algorithm ) and other talented school pupils of A. Kronrod. This was in 1968, long after the Bomb project completed. The work on the foundations of the chess program "Kaissa", created by members of A. Kronrod's team under guidance of Adelson-Velsky, was almost finished; "Kaissa" won the first world championship in 1974. Adelson-Velsky's new passion became discrete algorithms, which he felt had a great future.

The fundamental contribution of Adelson-Velsky to Computer Science was AVL-trees. He (AV) and Evgenii Landis (L) published a paper about AVL-trees in early 60's, consisting of just a few pages. Besides solving an important problem, it presented a bright approach to data structure maintenance. While this approach became standard in the USSR, it was still not known in the West. No reaction followed their publication during a couple of years, until another paper, 15 pages long, was published by a researcher, which understood how AVL-trees work and explained this to the Western community, in its language. Since then, AVL-trees and the entire data structure maintenance approach became a corner-stone of Computer Science.

The chronology of the events
Quotes by Mikhail Donskoy on the History of Kaissa

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's management. The first authors - Georgy Adelson-Velsky, Vladimir Arlazarov, Alexander Bitman, Alexander Zhivotovsky, Anatoly Uskov, A. Leman, M. Rozenfeld.

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

1969 - 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's management, but without Kronrod, after a certain time he settled in Institute of Control Sciences (ICF).

1970 - the mechanic mathematical department of 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:

Visit from Canada
Tony Marsland and Monty Newborn on Georgy Adelson-Velsky in their report of their USSR visit, December 1980 :

Adelson-Velsky, an extremely capable and animated scientist and a real pleasure to meet, generally led our technical discussions. His eyes seemed to glisten with enthusiasm when he spoke. Discussions centered around probabilistic analyses of various aspects of the minimax algorithm and parallel search of chess trees. Our first joint seminar on alpha-beta analysis and the impact of computer technology was attended by about thirty people, including Leonid Kantorovich, winner of the 1975 Nobel Prize in Economics for his work on linear programming.

=See also=
 * ITEP Chess Program Video, 1968
 * History of Kaissa

=Selected Publications=

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, 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
 * 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
 * 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
 * Г.М. Адельсон-Вельский, В.Л. Арлазаров, А.Р. Битман, М.В. Донской (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. amazon.com

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=
 * Early Reference on Bit-Boards by Tony Warnock, rgc, October 29, 1994
 * Kaissa & Botvinik by Shay Bushinsky, rgcc, October 16, 1997
 * Method of Analogies?? by Bruce Cleaver, CCC, May 29, 1998

=External Links=
 * Georgy Adelson-Velsky from Wikipedia
 * The Mathematics Genealogy Project - Georgiy Adelson-Velsky
 * Georgy M. Adelson-Velsky Biography, Dynkin Collection
 * Interview with Georgy Adelson-Velsky (pdf) by Eugene Dynkin, Moscow, September 1, 1990


 * Facts about Georgy Adelson-Velsky - Evi
 * Photos of Georgy M Adelson-Velsky (1922 - 2014) - ForeverMissed.com
 * Памяти Г. М. Адельсон-Вельского | Facebook
 * Адельсон Вельский Г.М. рассказывает 2002 год, YouTube Video

=References=

Up one level