25,161
edits
Changes
no edit summary
was a Russian mathematician and computer scientist. Kronrod and his fellow [[Georgy Adelson-Velsky]] were the last students of [[Mathematician#Luzin|Nikolai Luzin]] at [[Moscow State University]]. In the 50s and 60s Kronrod was professor and head of the Computational Laboratory at Moscows [[Institute of Theoretical and Experimental Physics]] (ITEF or '''ITEP'''). He was involved in developing the [[ITEP Chess Program]] in motivating his friends Georgy Adelson-Velsky and [[Alexander Brudno]], as well in his proposal of a "general [[Recursion|recursive]] search scheme". Kronrod is well known for saying, "chess is the [https://en.wikipedia.org/wiki/Drosophila Drosophila] of [[Artificial Intelligence|artificial intelligence]]" <ref>[https://en.wikiquote.org/wiki/Alexander_Kronrod Alexander Kronrod from Wikiquote]</ref>.
In 1965, while [[John McCarthy]] visited the [https://en.wikipedia.org/wiki/Soviet_Union Soviet Union], he was challenged by Kronrod, who considered the [[Kotok-McCarthy-Program]] to be the best program in the [https://en.wikipedia.org/wiki/United_States United States] at the time. At the end of 1966 the [[Stanford-ITEP Match|four game match]] was arranged between Kotok-McCarthy, running on a [[IBM 7090]] computer, and the ITEP Program on a Soviet [[M-220]] <ref>[http://www.computer-museum.ru/english/m2.htm The Fast Universal Digital Computer M-2] from the [[Russian Virtual Computer Museum]]</ref>. The match played over nine months was won 3-1 by the ITEP Program.
=Quotes=
