Template:Quote Shura-Bura
Revision as of 14:02, 3 May 2018 by GerdIsenberg (talk | contribs)
Quote from The Early Development of Programming in the USSR by Andrey Ershov and Mikhail R. Shura-Bura [1]
At the end of the 1950's a group of Moscow mathematicians began a study of computerized chess. Sixteen years later, the studies would lead to victory in the first world chess tournament for computer programs held in Stockholm during the 1974 IFIP Congress. An important component of this success was a deep study of the problems of information organization in computer memory and of various search heuristics. G. M. Adelson-Velsky and E. M. Landis invented the binary search tree ("dichotomic inquiry") and A. L. Brudno, independent of J. McCarthy, discovered the (α,β)-heuristic for reducing search times on a game tree.
