Georgy Adelson-Velsky

Georgy Maximovich Adelson-Velsky (Russian: Гео́ргий Макси́мович Адельсо́н-Ве́льский; name is sometimes transliterated as Georgii Adelson-Velskii), (b. 8 January 1922 in Samara, Russia) is a Soviet mathematician and computer scientist. Along with E.M. Landis, he invented the AVL tree in 1962.

In 1965, Adelson-Velsky headed the development of a computer chess program at the Institute for Theoretical and Experimental Physics in Moscow. The program defeated Kotok-McCarthy in the first chess match between computer programs, and evolved into Kaissa, the first world computer chess champion.

He visited University of Waterloo with Mikhail Donskoy. He currently resides in Ashdod, Israel.

Publications

• G.M. Adelson-Velskii, V.L. Arlazarov, A.R. Bitman, A.A. Zhivotovskii and A.V. Uskov, Programming a Computer to Play Chess, Russian Math. Surveys 25, (Mar-Apr 1970), 221-262, Cleaver-Hume Press, London. Translation of proceedings of the 1st Summer School on Mathematical Programming Vol. 2 (1969) 216-252

External links

• Autobiography (in Russian) – from Ashdod municipal web page
• [1] from http://chessprogramming.wikispaces.com
• [2] from Andrey Ershov's archive
• 1990 Moscow Interview with Adelson-Velsky, Eugene Dynkin Collection of Mathematics Interviews, Cornell University Library (in Russian, English transcript).