G. M. Adelson-Velskiy

Some Methods of Controlling the Tree Search in Chess Programs

G. M. Adelson-Velskiy, Vladimir L. Arlazarov, M. V. Donskoy, 1975, Artif. Intell..

On the Structure Of An Important Class Of Exhaustive Problems And On Ways Of Search Reduction For Them

G. M. Adelson-Velskiy, Vladimir L. Arlazarov, M. V. Donskoy, 1975, IJCAI.

What can we do with problems of exhaustive search?

G. M. Adelson-Velskiy, A. O. Slisenko, A. Slisenko, 1979, Algorithms in Modern Mathematics and Computer Science.

Some methods of controlling the tree search in chess programs

G. M. Adelson-Velskiy, Vladimir L. Arlazarov, M. V. Donskoy, 1988 .