Georgy Adelson-Velsky
Also known as Георгий Максимович Адельсон-Вельский, Адельсон-Вельский, Георгий Максимович, Georgii Adelson-Velskii
Georgy Adelson-Velsky was a mathematician who began working in artificial intelligence in the late 1950s. With Evgenii Landis, he invented the AVL tree in 1962, the first known balanced binary search tree. Beginning in 1963, he headed a computer chess program at the Institute for Theoretical and Experimental Physics in Moscow, and that program defeated the Kotok-McCarthy program by 1967. Kaissa, a program he helped write, won the first world computer chess championship in Stockholm in 1974. He moved to Israel in August 1992 and died in Givatayim in 2014, aged 92.
Timeline
-
1922–1949
From Samara to Moscow State
He is born in Samara and is originally educated as a pure mathematician. His first paper, written with Alexander Kronrod, wins a Moscow Mathematical Society prize in 1945. He graduates from Moscow State University in 1949 under Israel Gelfand.
-
1950s
Early work in artificial intelligence
In the late 1950s he begins work in artificial intelligence and other applied topics.
-
1962
The AVL tree
With Evgenii Landis, he invents the AVL tree in 1962, the first known balanced binary search tree.
-
1963–1974
From ITEP to Kaissa
From 1963 he heads the development of a computer chess program at the Institute for Theoretical and Experimental Physics in Moscow. By 1967 that program defeats the Kotok-McCarthy program. Kaissa, which he helps write, wins the first computer chess championship in Stockholm in 1974.
-
1975
A paper on tree search
In 1975 he co-writes "Some Methods of Controlling the Tree Search in Chess Programs" for the journal Artificial Intelligence.
-
August 1992
A move to Israel
In August 1992 he moves to Israel and settles in Ashdod.
-
2014
His death in Givatayim
He dies in 2014 in Givatayim, Israel, aged 92.
Sources and credits
Photo: We have no published photo of Georgy Adelson-Velsky yet. Send us a free-licensed photo.