ReferencesG. M. Adel'son-Vel'skii, V. L. Arlazarov, A. R. Bitman, A. A. Zhivotovskii, A. V. Uskov“Programming a computer to play chess”, Uspekhi Mat. Nauk, 1970, Volume 25, Issue 2(152),Pages 221

Programming a computer to play chess
G. M. Adel'son-Vel'skii, V. L. Arlazarov, A. R. Bitman, A. A. Zhivotovskii, A. V. Uskov



References

1.	C. Shannon, “Programming a computer for playing chess”, Philos. Mag., 41 (1950), 356–375 ; В сб.: К. Шеннон, Работы по теории информации и кибернетике, М., 1963, 192–222
2.	M. Eive, “Mashina igraet v shakhmaty”, Shakhmaty v SSSR, 1965, no. 11, 6–10; № 12, 18–20
3.	M. Botvinnik, Algoritm igry v shakhmaty, M., 1968
4.	A. Newell, J. C. Shaw, H. A. Simon, “Chess-playing programs and the problem of complexity”, J. of Res. and Devel. IBM, 2:4 (1958), 320–335 ; Вычислительные машины и мышление, Сб., М., 1967, 33–71
5.	A. Bernstein, M. de V. Roberts, “Computers vs. chess-player”, Sci. Amer., 198 (1958), 96–105
6.	A. D. de Groot, “Chess playing programs”, Proc. Konikl. Nederl. Akad. Wetensch., Amsterdam, ser. A-67, 1964
7.	R. B. Greenblatt, E. Donald, “Eastlake and Crocer S.D., The Greenblatt Chees Program.”, Proc. 1967 Fall Joint Computer Conf., 1967
8.	G. M. Adelson-Velskii, V. L. Arlazarov, A. R. Bitman, A. A. Zhivotovskii, A. V. Uskov, “O programmirovanii shakhmatnoi igry”, Trudy pervoi zimnei shkoly po matematicheskomu programmirovaniyu, no. II, 1969, 216–252
9.	A. L. Brudno, “Grani i otsenki dlya sokrascheniya perebora variantov”, Problemy kibernetiki, 1963, no. 10, 141–150
10.	J. V. Neumann, “Zur Theorie der Gesellschafts-spiele”, Math. Ann., 100 (1928), 295–320 ; Матричные игры, Сб., М., 1961, 173–204
11.	E. Zermelo, “Über eine Anwendung der Mengenlehre auf die Theorie des Schachspiels”, Proc. of the Fifth Intern. Congr. of Math., Cambridge Univers. Press, 1913, 501–504; Матричные игры, Сб., М., 1961, 167–172
12.	S. S. Lavrov, Universalnyi yazyk programmirovaniya (Algol 60), izd. 2, M., 1967
13.	A. Newell, J. E. Shaw, U. A. Simon, “Report on a general problem-solving program”, Proc. of the Intern. Conf. on a Inform. Process. (ICIP), UNESCO House, Paris, 1959, 256–264 ; А. Ньюэлл и Т. Саймон (ред.), Вычислительные машины и мышление, Сб., М., 1967, 281–301
14.	A. L. Brudno, Programmirovanie v soderzhatelnykh oboznacheniyakh, izd. 2, M., 1968
15.	N. W. Peterson, “Adressing for random-access storage”, Journ. of Res. and Devel. IBM, 1:2 (1957)
16.	G. M. Adelson-Velskii, E. M. Landis, “Odin algoritm organizatsii informatsii”, DAN, 146:2 (1962), 263–266
17.	A. P. Ershov, “O programmirovanii arifmeticheskikh operatorov”, DAN, 118:3 (1961)
18.	I. E. Maizlin, “Ob odnom sposobe poiska informatsii i ego primenenii pri realizatsii na EVM algoritma nakhozhdeniya kriticheskogo puti”, DAN, 159:4 (1964), 761–763
19.	V. Podderjugin, “Über die Organisation von Speichern nach dem Prinzip der Adressenberechnung, III Intern. Collog. über Akt. Probl. der Rechentechnik”, Wiss. Z. der Techn. Univers. Dresden, 7:5 (1968)
20.	Semantic Informatino Processing, MIT-Press, Boston, 1968
21.	V. L. Arlazarov, A. R. Bitman, “Obygraet li mashina cheloveka?”, Shakhmaty v SSSR, 1968, no. 2, 9–11