Changes

an early Soviet chess program developed by a group of scientists at the [https://en.wikipedia.org/wiki/Steklov_Institute_of_Mathematics Steklov Institute of Mathematics] headed by [[Mikhail R. Shura-Bura]], including [[Igor B. Zadyhailo]] and [[Marat A. Evgrafov]], with further support of physicist and science journalist [[Volʹdemar Smilga]]. A brief description of the program was given in an interview with Shura-Bura on computer chess by V. TomanovTumanov, published as part in the 8th Bulletin of the [https://en.wikipedia.org/wiki/World_Chess_Championship_1961 Botvinnik Tal 1961 revenge-match] for the [https://en.wikipedia.org/wiki/World_Chess_Championship world chess championship] - entitled "The best move in 58 seconds", cited in [[Jaap van den Herik|Jaap van den Herik's]] Ph.D. thesis ''Computerschaak, Schaakwereld en Kunstmatige Intelligentie'' <ref>[[Jaap van den Herik]] ('''1983'''). ''Computerschaak, Schaakwereld en Kunstmatige Intelligentie''. Ph.D. thesis, [[Delft University of Technology]]. Academic Service, The Hague. ISBN 90 62 33 093 2 (Dutch), 2.2.9. Sjoera-Boera - translation from Russian by J.P. Warris, Russian teacher at TH Delft</ref>. Further, two games of the program were published. Hardware A more elaborate description was not mentionedgiven by Evgrafov and Zadyhailo in 1965, presumably Shurafeaturing some [[M-Bura's Program ran on a 20]] machine code with comments <ref>[[https://enMarat A. Evgrafov|М.wikipediaА.org/wiki/Strela_computer StrelaЕвграфов]] or , [[M-20Igor B. Zadyhailo|И. Б. Задыхайло]] computer('''1965'''). ''Некоторые соображения о программировании шахматной игры''. / Сб. Проблемы кибернети</ref>.

==[[Board Representation]]==The program is reported without any [[SearchChess Position|chess position]] structure obtains a [[Attack and Defend Maps|piece to square interaction map]], that includes seven different features to speed up [[Move Generation|move generation]] and [[Evaluation|evaluation]] <ref>[http://www.talkchess.com/forum3/viewtopic.php?f=2&t=70939&start=12 Re: The mystery of Alex Bernstein] by [[Sergei Markoff|Sergei S. Markoff]], [[CCC]], June 08, 2019</ref>:# [[Pieces|Piece]] attacks and can move to [[Squares|Square]]# Piece does not attack but can move to Square# Piece attacks and but can not move to Square# Piece indirectly attacks Square through a sliding piece # Piece indirectly attacks Square through a [[Pawn Attacks (Bitboards)|searchpawn attack]]# Piece indirectly attacks Square through a Piece not attacking Square# Blocked pawn target ==[[Evaluation]] ==The program is reported to select the best move with the help of a [[Evaluation|static evaluation function]], which had seven distinct components:

* В. Туманов ('''1961'''). ''Лучший ход» — за 58 секунд''. Таль—Ботвинник: матч-реванш на первенство мира. Бюллетень Центрального шахматно: V. Tomanov Tumanov ('''1961'''). ''The best move in 58 seconds''. in the 8th Bulletin of the [https://en.wikipedia.org/wiki/World_Chess_Championship_1961 Botvinnik Tal 1961 revenge-match]* [[Marat A. Evgrafov|М. А. Евграфов]], [[Igor B. Zadyhailo|И. Б. Задыхайло]] (Russian'''1965'''). ''Некоторые соображения о программировании шахматной игры''. / Сб. Проблемы кибернети: [[Marat A. Evgrafov]], [[Igor B. Zadyhailo]] ('''1965'''). ''Some Considerations for Chess Game Programming''. in Problems of Cybernetic, No. 15 <ref>[http://www.talkchess.com/forum3/viewtopic.php?f=2&t=70939&start=8 Re: The mystery of Alex Bernstein] by Roman Zhukov, [[CCC]], June 08, 2019</ref>