Georgy+Adelson-Velsky

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//.
 * Home * People * Georgy Adelson-Velsky**
 * [[image:Adelson-Velsky-G.Moscow-1980.jpg width="308" link="http://www.computerhistory.org/chess/full_record.php?iid=stl-430b9bbe4e16c"]] ||~  || **Georgy Maximovich Adelson-Velsky**, (Гео́ргий Макси́мович Адельсо́н-Ве́льский, January 8, 1922 - April 26, 2014)

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 [|Giv'atayim], Israel. || toc =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.
 * Adelson-Velsky in Moscow 1980 ||~  ||^   ||

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= Soviet-American computer science conference, [|Urgench], 1979 || =Quotes=
 * [[image:AdelsonVelskyMcCarthy.jpg width="560" link="http://www.forevermissed.com/georgy-m-adelson-velsky/gallery#gallery%2Fphotos%2F350356"]] ||
 * Georgy Adelson-Velsky and John McCarthy playing chess,
 * [[image:AdelsonVelsky.jpg width="560" link="http://www.computerhistory.org/chess/full_record.php?iid=stl-431f4cc168f00"]] ||
 * Adelson-Velsky explaing his work on the analysis of the Minimax algorithm, Moscow 1980 ||
 * Adelson-Velsky explaing his work on the analysis of the Minimax algorithm, Moscow 1980 ||

Official Information
by Mikhail Donskoy (1999) on Kaissa

Remembering A.S. Kronrod
Quote from //Remembering A.S. Kronrod// by Evgenii Landis and Isaak Yaglom : include page="Quote Remembering Kronrod"

Intellectual Foundations
Quote from //Biography AS Kronrod// by Alexander Yershov include page="Quote Yershov"

Hashing
Quote from Mikhail Donskoy's //life cycle of a programmer// : include page="Quote Donskoy"

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// :

Ershov and Shura-Bura
Quote from //The Early Development of Programming in the USSR// by Andrey Ershov, Mikhail R. Shura-Bura include page="Quote Shura-Bura"

Donskoy
Quote by Mikhail Donskoy from a [|Radio Liberty] interview on an anecdote concerning Georgy Adelson-Velsky and [|AVL trees] : include page="Quote Donskoy on AVL"

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

||

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

=See also=
 * History of Kaissa

=Selected Publications=

1957 ...

 * 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

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, pp. 361-371. ISSN 0004-3702. Reprinted (**1988**) in Computer Chess Compendium pp. 129-135.
 * 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-Verlag, 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= > [|Interview with Georgy Adelson-Velsky] (pdf) by [|Eugene Dynkin], Moscow, September 1, 1990 > media type="youtube" key="cE4Zb9wWf7g" height="360" width="480"
 * [|Georgy Adelson-Velsky from Wikipedia]
 * [|The Mathematics Genealogy Project - Georgiy Adelson-Velsky]
 * [|Georgy M. Adelson-Velsky Biography], [|Dynkin Collection]
 * [|Facts about Georgy Adelson-Velsky - Evi]
 * [|Photos of Georgy M Adelson-Velsky (1922 - 2014) - ForeverMissed.com]
 * [|Памяти Г. М. Адельсон-Вельского | Facebook]
 * Адельсон Вельский Г.М. рассказывает 2002 год, [|YouTube] Video

=References= =What links here?= include page="Georgy Adelson-Velsky" component="backlinks" limit="100"
 * Up one level**