25,161
edits
Changes
Created page with "'''Home * Engines * Pioneer''' border|right|thumb|[[Arts#McCubbin|Frederick McCubbin - Th..."
'''[[Main Page|Home]] * [[Engines]] * Pioneer'''
[[FILE:Frederick McCubbin - The pioneer - Google Art Project.jpg|border|right|thumb|[[Arts#McCubbin|Frederick McCubbin]] - The pioneer, 1904 <ref>[[Arts#McCubbin|Frederick McCubbin]], The pioneer, 1904, oil on canvas, [https://en.wikipedia.org/wiki/National_Gallery_of_Victoria National Gallery of Victoria], [https://en.wikipedia.org/wiki/Melbourne Melbourne], [https://en.wikipedia.org/wiki/The_Pioneer_%28painting%29 The Pioneer (painting) from Wikipedia]</ref> ]]
'''Pioneer''', (Russian: Пионер)<br/>
was a Soviet [[Artificial Intelligence]] project headed by [[Mikhail Botvinnik]] with the aim to develop a chess program to model a Chess Master's Mind, also used as general purpose planning tool to solve [https://en.wikipedia.org/wiki/Economic_system economical] problems in the [https://en.wikipedia.org/wiki/Soviet_Union Soviet Union]. Based on a hierarchical mathematical model consisting of [[Square Control|square control]], [[Trajectory|trajectories]], sheaves of trajectories, and counter trajectories of attacking and defending pieces, piece chains, and zones, and the intermediate goal to win [[Material|material]] within a given horizon, its purpose was a [[Minimax|minimax]] [[Best-First|best-first search]] of extremely narrow but deep game trees. The name Pioneer was chosen in 1977, when the program was invited to play the [[WCCC 1977]] in Toronto. However, Pioneer was never completed in a way that it could play a [[Chess Game|game of chess]] in public under tournament conditions <ref>[https://www.stmintz.com/ccc/index.php?id=211423 Re: KAISSA for PC, I'm the proud owner] by [[Eugene Nalimov]], [[CCC]], February 01, 2002</ref>.
=Early Ideas=
Botvinnik's early ideas on [[Attack and Defend Maps|attack maps]] were already formulated and published the late 50s and 60s. At [https://en.wikipedia.org/wiki/Chess_Centres Moscow Central Chess Club] <ref>[http://en.chessbase.com/home/TabId/211/PostId/4007513 The last day of the “Botvinnik Memorial”] by [http://de.wikipedia.org/wiki/Anna_Denissowna_Burtassowa Anna Burtasova], [[ChessBase|ChessBase News]], September 07, 2011</ref> in 1966, with the skeptical [[Georgy Adelson-Velsky]] and others attending, he introduced the concept of [[Trajectory|trajectories]] and found [[Vladimir Butenko]] as supporter and collaborator. Butenko first implemented the [[Vector Attacks|15x15 vector attacks]] board representation on a [[M-20]] computer, [[Distance#15x15|determining trajectories]]. The table below demonstrates the [[Distance|distance]] from a square (here c2) on a 8x8 board, superimposed on the 15x15 array in such a way that the from square (c2) coincides with the central square of the 15x15 array, which is the origin, tail, or base of all displacement vectors <ref>[[Boris Stilman]] ('''1994'''). ''A Linguistic Geometry of the Chess Model''. [[Advances in Computer Chess 7]], [http://www.stilman-strategies.com/bstilman/boris_papers/Jour94_CHESS7.pdf pdf draft]</ref> .
<pre>
╔════╤════╤════╤════╤════╤════╤════╤════╤════╤════╤════╤════╤════╤════╤════╗
210 ║ 7 | 7 | 7 | 7 | 7 | 7 | 7 | 7 | 7 | 7 | 7 | 7 | 7 | 7 | 7 ║
╟────┼────┼────┼────┼────╔════╤════╤════╤════╤════╤════╤════╤════╗────┼────╢
195 ║ 7 | 6 | 6 | 6 | 6 ║ 6 | 6 | 6 | 6 | 6 | 6 | 6 | 6 ║ 6 | 7 ║
╟────┼────┼────┼────┼────╟────┼────┼────┼────┼────┼────┼────┼────╢────┼────╢
180 ║ 7 | 6 | 5 | 5 | 5 ║ 5 | 5 | 5 | 5 | 5 | 5 | 5 | 5 ║ 6 | 7 ║
╟────┼────┼────┼────┼────╟────┼────┼────┼────┼────┼────┼────┼────╢────┼────╢
165 ║ 7 | 6 | 5 | 4 | 4 ║ 4 | 4 | 4 | 4 | 4 | 4 | 4 | 5 ║ 6 | 7 ║
╟────┼────┼────┼────┼────╟────┼────┼────┼────┼────┼────┼────┼────╢────┼────╢
150 ║ 7 | 6 | 5 | 4 | 3 ║ 3 | 3 | 3 | 3 | 3 | 3 | 4 | 5 ║ 6 | 7 ║
╟────┼────┼────┼────┼────╟────┼────┼────┼────┼────┼────┼────┼────╢────┼────╢
135 ║ 7 | 6 | 5 | 4 | 3 ║ 2 | 2 | 2 | 2 | 2 | 3 | 4 | 5 ║ 6 | 7 ║
╟────┼────┼────┼────┼────╟────┼────┼────┼────┼────┼────┼────┼────╢────┼────╢
120 ║ 7 | 6 | 5 | 4 | 3 ║ 2 | 1 | 1 | 1 | 2 | 3 | 4 | 5 ║ 6 | 7 ║
╟────┼────┼────┼────┼────╟────┼────╔════╗────┼────┼────┼────┼────╢────┼────╢
105 ║ 7 | 6 | 5 | 4 | 3 ║ 2 | 1 ║ 0 ║ 1 | 2 | 3 | 4 | 5 ║ 6 | 7 ║
╟────┼────┼────┼────┼────╟────┼────╚════╝────┼────┼────┼────┼────╢────┼────╢
90 ║ 7 | 6 | 5 | 4 | 3 ║ 2 | 1 | 1 | 1 | 2 | 3 | 4 | 5 ║ 6 | 7 ║
╟────┼────┼────┼────┼────╚════╧════╧════╧════╧════╧════╧════╧════╝────┼────╢
75 ║ 7 | 6 | 5 | 4 | 3 | 2 | 2 | 2 | 2 | 2 | 3 | 4 | 5 | 6 | 7 ║
╟────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────╢
60 ║ 7 | 6 | 5 | 4 | 3 | 3 | 3 | 3 | 3 | 3 | 3 | 4 | 5 | 6 | 7 ║
╟────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────╢
45 ║ 7 | 6 | 5 | 4 | 4 | 4 | 4 | 4 | 4 | 4 | 4 | 4 | 5 | 6 | 7 ║
╟────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────╢
30 ║ 7 | 6 | 5 | 5 | 5 | 5 | 5 | 5 | 5 | 5 | 5 | 5 | 5 | 6 | 7 ║
╟────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────╢
15 ║ 7 | 6 | 6 | 6 | 6 | 6 | 6 | 6 | 6 | 6 | 6 | 6 | 6 | 6 | 7 ║
╟────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────╢
0 ║ 7 | 7 | 7 | 7 | 7 | 7 | 7 | 7 | 7 | 7 | 7 | 7 | 7 | 7 | 7 ║
╚════╧════╧════╧════╧════╧════╧════╧════╧════╧════╧════╧════╧════╧════╧════╝
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14
</pre>
[[Boris Stilman]] gave following example to generate a set or sheave of trajectories for a king moving from f6 to h1 <ref>[[Boris Stilman]] ('''1994'''). ''A Linguistic Geometry of the Chess Model''. [[Advances in Computer Chess 7]], [http://www.stilman-strategies.com/bstilman/boris_papers/Jour94_CHESS7.pdf pdf draft]</ref> :
<pre>
D(f6,K) + D(h1,K) = SUM SUM == D(f6,h1)
5 4 3 2 2 2 2 2 7 7 7 7 7 7 7 7 c b a 9 9 9 9 9 . . . . . . . .
5 4 3 2 1 1 1 2 7 6 6 6 6 6 6 6 c a 9 8 7 7 7 8 . . . . . . . .
5 4 3 2 1 0 1 2 7 6 5 5 5 5 5 5 c a 8 7 6|5|6 7 . . . . . 1 . .
5 4 3 2 1 1 1 2 7 6 5 4 4 4 4 4 c a 8 6|5 5 5|6 . . . . 1 1 1 .
5 4 3 2 2 2 2 2 + 7 6 5 4 3 3 3 3 = c a 8 6|5 5 5 5| . . . . 1 1 1 1
5 4 3 3 3 3 3 3 7 6 5 4 3 2 2 2 c a 8 7 6|5 5 5| . . . . . 1 1 1
5 4 4 4 4 4 4 4 7 6 5 4 3 2 1 1 c a 9 8 7 6|5 5| . . . . . . 1 1
5 5 5 5 5 5 5 5 7 6 5 4 3 2 1 0 c b a 9 8 7 6|5| . . . . . . . 1
</pre>
=Mathematical Projection=
In Botvinnik's hierarchical Mathematical Projection ('''MP''') of chess as a complex system, trajectories build the lowest level of the hierarchy. The concepts of zones as intermediate level of the MP consists of a network of main trajectories conform to attacking or defending plans determined elsewhere, negation trajectories, that is opponent's counter trajectories which may block or combat the primary trajectory in time, and own supporting counter-counter trajectories. The MP controls the growth of a [[Search Tree|search tree]] inside a [[Best-First|best-first search]], and [[Pruning|prunes]] all branches forward which could not reach a goal in time. After Botvinnik introduced the concept of Zones in 1970, Butenko refused further cooperation and began to write his own [[Butenko's program|program]] <ref>[http://atimopheyev.narod.ru/Frame/index.html Лингвистическая Геометрия] Бориса Штильмана, [http://translate.googleusercontent.com/translate_c?hl=de&ie=UTF8&prev=_t&rurl=translate.google.com&sl=ru&tl=en&u=http://atimopheyev.narod.ru/Frame/index.html&usg=ALkJrhjGqyvJey-MTGqcGxzMU53Od0Y7VQ Linguistic Geometry] [[Boris Stilman]] by [[Alexander Timofeev]] ([https://en.wikipedia.org/wiki/Google_Translate Google Translate])
[http://atimopheyev.narod.ru/AfterPIONEER/index.html По стопам ПИОНЕРа], [http://translate.googleusercontent.com/translate_c?hl=de&ie=UTF8&prev=_t&rurl=translate.google.com&sl=ru&tl=en&u=http://atimopheyev.narod.ru/AfterPIONEER/index.html&usg=ALkJrhh0I8eGI93tpR27m-YIWUnG3l5SjA In the footsteps of Pioneer]</ref> .
=Further Research=
In the 70s and 80s, a team around [[Boris Stilman]], [[Alexander Yudin]], [[Alexander Reznitskiy]], [[Michael Tsfasman]], [[Vadim Mirniy]] and [[Mikhail Chudakov]] worked on Pioneer at the ''State Committee for Science and Technology'', [https://en.wikipedia.org/wiki/Moscow Moscow], [https://en.wikipedia.org/wiki/Soviet_Union USSR], the ''National Research Institute for Electrical Engineering'', Moscow, USSR and the [https://en.wikipedia.org/wiki/Russian_Academy_of_Sciences USSR Academy of Sciences], Moscow, USSR. Botvinnik and his team proposed a [[Attack and Defend Maps|attack map]] and offset map [[Move Generation|move generating]] strategy <ref>[[David Kittinger]], [[Scott McDonald]] ('''1984'''). ''Report from the U.S. Open''. [[Computer Chess Reports|Computer Chess Digest Annual 1984]] pp. 15-33</ref> based on [[Vector Attacks]] <ref>[[Boris Stilman]] ('''1994'''). ''A Linguistic Geometry of the Chess Model''. [[Advances in Computer Chess 7]], [http://www.stilman-strategies.com/bstilman/boris_papers/Jour94_CHESS7.pdf pdf draft]</ref> , and a hierarchical geometrical model based on trajectories, sheaves of trajectories and chains - a set of pieces, each with their trajectories, enjoying the property of aiding or hindering the attack of a piece against a target. Based on this research, Boris Stilman later coined the term [[Linguistic Geometry]] <ref>[http://www.stilman-strategies.com/bstilman/lgmain.html The Home Page of Linguistic Geometry]</ref> , a new type of game theory <ref>[[José Roberto Mercado Vega]], [[Zvi Retchkiman Königsberg]] ('''2009'''). ''[http://portal.acm.org/citation.cfm?id=1719355&dl=GUIDE&coll=GUIDE&CFID=77083768&CFTOKEN=17475304 Modeling the Game of Arimaa with Linguistic Geometry]''. [http://www.informatik.uni-trier.de/~ley/db/conf/cig/cig2009.html#VegaK09 CIG'09] » [[Arimaa]]</ref>. Alexander Reznitskiy and Mikhail Chudakov presented the current state of a long development originated by Botvinnik in an [[ICGA Journal#13_4|1990 ICCA Journal]] article <ref>[[Alexander Reznitskiy]], [[Mikhail Chudakov]] ('''1990'''). ''Pioneer: a Chess Program Modelling a Chess Master's Mind''. [[ICGA Journal#13_4|ICCA Journal, Vol. 13, No. 4]]</ref>.
=Controversy=
Botvinnik published abilities of Pioneer and its successor [[CC Sapiens]] on selected positions, but they never played a complete game of chess in public. For his publication ''Three Positions'' <ref>[[Mikhail Botvinnik]] ('''1993'''). ''Three Positions''. [[ICGA Journal#16_2|ICCA Journal, Vol. 16, No. 2]]</ref> , Botvinnik was heavily criticized by [[Hans Berliner]] <ref>[[Hans Berliner]] ('''1993'''). ''Playing Computer Chess in the Human Style''. [[ICGA Journal#16_3|ICCA Journal, Vol. 16, No. 3]]</ref> <ref>[http://groups.google.com/group/rec.games.chess/browse_frm/thread/c6c81bbb1a2b399f# Kasparov missed Beautiful win; Botvinnik's Program muffs analysis] by [[Hans Berliner]], [[Computer Chess Forums|rec.games.chess]], July 9, 1993</ref> <ref>[https://groups.google.com/d/msg/rec.games.chess.computer/ZWQ5ZwvXx_s/EgXPrz6jZFYJ Botvinnik article] by [[Jonathan Schaeffer]], [[Computer Chess Forums|rgcc]], October 23, 1996</ref> <ref>[http://atimopheyev.narod.ru/AfterPIONEER/info/PIONEER/2-Berliner.htm Hans Berliner against Mikhail Botvinnik] by [[Alexander Timofeev]]</ref> , and his old chess rival [[David Bronstein]] <ref>[[David Bronstein]] ('''1993'''). ''Mimicking Human Oversight''. [[ICGA Journal#16_3|ICCA Journal, Vol. 16, No. 3]]</ref> .
=Photos=
==McGill University 1977==
[[FILE:3-3.Botvinnik.McGill_University_Lecture.Montreal.1977.102645344.NEWBORN.lg.jpg|none|border|text-bottom|640px|link=http://archive.computerhistory.org/resources/still-image/Chess_temporary/still-image/]]
Botvinnik's Lecture on Pioneer at [[McGill University]] 1977 - any questions? [[Monroe Newborn|Monty Newborn]] left <ref>Photo Courtesy [[Monroe Newborn]] from [[The Computer History Museum]], [http://archive.computerhistory.org/resources/still-image/Chess_temporary/still-image/ archive.computerhistory.org - /resources/still-image/Chess_temporary/still-image/]</ref>
==Moscow 1980==
[[FILE:ReznitkiyStilmanDonskoyBotvinnikNewborn.jpg|none|border|text-bottom|640px|link=http://archive.computerhistory.org/resources/still-image/Chess_temporary/still-image/3-3.Resnitsky_Stilman_Donskoy_Botvinnik_Newborn.Moscow.1980.102645342.NEWBORN.jpg]]
[[Alexander Reznitskiy|A. Reznitskiy]], [[Boris Stilman|B. Stilman]], [[Mikhail Donskoy|M. Donskoy]] ([[Kaissa]]), [[Mikhail Botvinnik|M. Botvinnik]], [[Monroe Newborn|Monty & Amy Newborn]] <ref>[[Tony Marsland]], [[Monroe Newborn|Monty Newborn]] ('''1981'''). ''A brighter future for Soviet computer chess?'' [[ICGA Journal#4_1|ICCA Newsletter, Vol. 4, No. 1]], [http://webdocs.cs.ualberta.ca/~tony/OldPapers/Marsland-Newborn-1981.pdf pdf]</ref> <ref>[http://www.computerhistory.org/chess/full_record.php?iid=stl-430b9bbd70434 Monroe Newborn and Soviet computer chess developers in Moscow], Gift of [[Monroe Newborn]], 1980</ref> <ref>[http://en.chessbase.com/post/computer-che-pioneer-mikhail-donskoy-paes-on Computer chess pioneer Mikhail Donskoy passes on] from [[ChessBase|ChessBase News]], January 16, 2009</ref> <ref>[http://groups.google.com/group/rec.games.chess.computer/browse_frm/thread/e9f5b809a7ac0952 Kaissa & Botvinik] by [[Shay Bushinsky]], [[Computer Chess Forums|rgcc]], October 16, 1997</ref>
=Timeline=
<ref>based on [http://atimopheyev.narod.ru/AfterPIONEER/index.html По стопам ПИОНЕРа], [http://translate.googleusercontent.com/translate_c?hl=de&ie=UTF8&prev=_t&rurl=translate.google.com&sl=ru&tl=en&u=http://atimopheyev.narod.ru/AfterPIONEER/index.html&usg=ALkJrhh0I8eGI93tpR27m-YIWUnG3l5SjA In the footsteps of Pioneer], [http://atimopheyev.narod.ru/AfterPIONEER/inPIONEERsFootsteps/Chronology_of_Model.HTM Chronology]</ref>
{| class="wikitable"
|-
! 1958
| Botvinnik's idea to make computer grandmaster.
|-
! 1960
| Botvinnik's Lecture Humboldt University Berlin: "Men and machines at the chessboard."
|-
! 1961
| Article: MM Botvinnik, ''Men and machines at the chess board''. Chess in the USSR, 1961, № 3, Moscow
|-
! 1964
| Goal game of chess (Botvinnik, PIONEER , Mansurov, 2004).
|-
! 1966
| Dispute in Central Chess Club. Trajectory shapes. 15x15 table. Vladimir Butenko programs the trajectory of chess pieces
|-
! 1968
| Book: MM Botvinnik, chess algorithm , ''Nauka'', Moscow, 1968 tactical cost of pieces
|-
! 1969
| Concept of Zones
|-
! 1970
| Book: MM Botvinnik ''[http://link.springer.com/book/10.1007/978-1-4684-6245-6 Computers, Chess and Long-Range Planning]''. [https://de.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer]
|-
!
| Butenko's refusal to fruther cooperate with Botvinnik
|-
! 1972
| New Programmers: Boris Stillman and Alexander Yudin
|-
!
| Computer time on an English computer [[ICL 4-70|ICL 4/70]] (clone of [[IBM 360|IBM/360]])
|-
! 1976
| Stillman BM, ''About the formation of the playing area''. Dep. VINITI 3947-76, (also in Stillman BM, 1979 ). Stillman BM ''The tree in the zone busting game''. Dep. VINITI 3947a-76 (also in Stillman BM, 1979 ).
|-
! 1976
| Invitation to a [[WCCC 1977|second world championship of chess programs]] in Toronto, Canada.
|-
! 1977
| Chess program dubbed Pioneer
|-
! 1978
| MM Botvinnik, BM Stillman, AD Yudin ''Artificial chess master''. Bulletin of the Academy of Sciences of the USSSR, Moscow, 1978, № 4, p.82-91.
|-
! 1978
| BM Stillman ''Research-based management model of a chess game''. Technical report, VNIIE, Moscow, 1978
|-
! 1978
| Grants for computer time:
|-
!
| At [https://en.wikipedia.org/wiki/University_of_Mannheim University of Mannheim] ([https://en.wikipedia.org/wiki/Hans_Meuer Hans Meuer]) for the improvement and completion of the PIONEER project (For 0.5 year), Germany <ref>[http://chess-news.ru/en/node/8210 Martin Meuer: "I Wanted to Do Something Different in Conjunction with Computers"] | [http://chess-news.ru/ chess-news.ru], June 28, 2012</ref>.
|-
!
| At [[University of Dortmund]] ([[Hans-Jürgen Appelrath]]) for the development of AI theory of complex systems and its application to the PIONEER project (for 0.5 year), Germany.
|-
!
| From [https://en.wikipedia.org/wiki/Control_Data_Corporation Control Data Corp.] (CDC, [[David Cahlander]]) for the improvement of the PIONEER program and development of efficient methods for solving practical search problems (for 0.5 year), USA.
|-
! 1980
| MM Botvinnik, BM Stillman, AD Yudin, AI Reznitskii, MA Tsfasman ''The chess players and computers''. Preprint for the 2nd International Symposium on Artificial Intelligence, 9 pages, Repino, Leningrad, Russia, in October 1980.
|-
!
| Retired programmer: Alexander Yudin
|-
! 1980
| New developer: Mikhail Chudakov, Vadim Mirniy
|-
! 1981
| Retired programmer: Michael Tsfasman
|-
! 1981
| The grant for computer time (600 rubles)
|-
!
| From the USSR National Committee for Science and Technology for the design of new methods and software for solving complex search problems, (For 3 years, MM Botvinnik, BM Stilman, V Mirniy, AI Reznitskiy), USSR.
|-
! 1988
| Retired programmers: Vadim Mirniy and Boris Stillman
|-
! 1990
| Dismissed programmers: Alexander Reznitskiy and Mikhail Chudakov
|-
! 1990
| End of project Pioneer
|-
! 1994
| [[CC Sapiens]]
|}
=Quotes=
==Rushton and Marsland==
[[Paul Rushton]] and [[Tony Marsland]], 1973, in ''Current Chess Programs'' <ref>[[Paul Rushton]], [[Tony Marsland]] ('''1973'''). ''Current Chess Programs: A Summary of their Potential and Limitations''. INFOR Journal of the Canadian Information Processing Society Vol. 11, No. 1, [http://webdocs.cs.ualberta.ca/~tony/OldPapers/Rushton-Marsland-Feb73.pdf pdf]</ref> :
A novel idea has been proposed by Botvinnik. He believes it is important to know which pieces are able to reach a certain square or sector of the board in a set number of half-moves. In this manner it is possible to determine the pieces that one should be concerned with when planning a move and it establishes what Botvinnik calls an "horizon." Thus one could vary the horizon by changing the amount of time pieces are allowed to take in arriving at a given area. At the present time some of his ideas have been programmed, but the successful completion of a program based on Botvinnik's ideas has not yet been announced.
==David Kittinger==
[[David Kittinger]] and [[Scott McDonald]] in [[Computer Chess Reports|Computer Chess Digest Annual 1984]] on [[Novag]] [[Constellation]] <ref>[[David Kittinger]], [[Scott McDonald]] ('''1984'''). ''Report from the U.S. Open''. [[Computer Chess Reports|Computer Chess Digest Annual 1984]] pp. 15-33</ref> :
The Novag Constellation programs represent a significant evolutionary step in the development of microcomputer chess programs. The program represents the first commercial implementation of the [[Attack and Defend Maps|attack map]] / offset map move generating strategy proposed by former World Chess Champion Mikhail Botvinnik and subsequently refined by myself for faster [[Move Generation|move generation]] as pieces come off the board.
==Reznitskiy and Chudakov==
[[Alexander Reznitskiy]] and [[Mikhail Chudakov]] in [[ICGA Journal#13_4|ICCA Journal, Vol. 13, No. 4]] <ref>[[Alexander Reznitskiy]], [[Mikhail Chudakov]] ('''1990'''). ''Pioneer: a Chess Program Modelling a Chess Master's Mind''. [[ICGA Journal#13_4|ICCA Journal, Vol. 13, No. 4]]</ref>:
PIONEER has been tested on various positions. For experiments we used an [[x86|80386]] based computer running at 20 MHz. The outcome shows the approach described in its advantage as well in its disadvantage.
So far PIONEER cannot regarded as a competetive player. The program is not fast enough to play under tournament conditions. It takes up to several hours to complete a search. Moreover, we found out, PIONEER fails to find a solution in some positions (especially in endgames).
Nevertheless, fortunately in mosts cases PIONEER manages to find the strongest move. If so, the program has found this move in a human fashion. It discovers the position's essence, correctly specifies subgoals and directs its search towards these subgoals. In accordance with this, all the trees are small, narrow and deep, and contain only reasonable variations of variable depth, truncated by logical considerations.
==Boris Stilman==
[[Boris Stilman]] in ''Linguistic Geometry''. Acknowledgments <ref>[[Boris Stilman]] ('''2000'''). ''[http://atimopheyev.narod.ru/LG01pdf_in_HTML/LG01_eng.HTML Linguistic Geometry - From Search to Construction]''. Operations Research/Computer Science Interfaces Series. Springer US, ISBN: 978-0-7923-7738-2, [http://atimopheyev.narod.ru/LG01pdf_in_HTML/LG01_eng.HTML#ACKNOWLEDGMENTS Acknowledgments]</ref> :
This book was inspired by the results of long and fruitful collaboration in the 70s and 80s with Professor Mikhail Botvinnik, my research adviser and project director. At the very beginning he shaped my thinking about complex search problems. One scientist said that this unimaginably difficult work could have started because Botvinnik, a chess player, did not anticipate the difficulties of programming, while Stilman, a computer scientist, did not anticipate difficulties of playing chess. Every time when the team of researchers experienced serious problems in the development of the project PIONEER, Dr. Botvinnik used to say: “If a human chess master can make it, a computer will make it as well.” He believed in the existence of a general algorithm, or a small collection of general algorithms, used intuitively by all the chess masters and grandmasters in playing chess. Essentially, discovery, simulation and generalization of these algorithms were the goals of the project PIONEER. An attempt to construct and investigate a mathematical model based on those algorithms is the goal of this book. Alexander Yudin, Alexander Reznitskiy, Mikhail Tsfasman, Mikhail Chudakov have worked with me in the 70s and 80s to develop project PIONEER. My friend and colleague, Vadim Mirniy, with whom we worked in the 80s provided major insights and pushed our research and software implementations to much higher level. Also, in the 70s an invaluable technical assistance in software development was provided by Dmitry Lozinskiy, Lidia Poltavets, and Anatoliy Kostrukov. Four major scientists, the founders of computer science and engineering in the former Soviet Union, Academician Viktor Glushkov, Professors Bashir Rameev, Viacheslav Myasnikov and Nikolay Krinitskiy contributed to the establishment of the organizational framework, provided major funding and access to the state-of-the-art computers for project PIONEER.
Project PIONEER and the first theoretical generalizations related to the origin of LG would have never succeeded without constant support of numerous Soviet scientists. I am grateful to all of them. Here, I would like to acknowledge those whose decisive support came at the most difficult times. They are Academician Nikolay Krasovsky, Academician-correspondent, Lenin Prize Winner Yakov Tsipkin, Academician-correspondents Yury Rudenko and Hermogen Pospelov, Professors Dmitry Pospelov, David Yudin, [[Mathematician#VAYakubovich|Vladimir Yakubovich]], [[Georgy Adelson-Velsky]], Yuriy Shakarian, Gavriil Shalit, Lev Mamikoniants and [[Mikhail Donskoy|Dr. Mikhail Donskoy]].
Scientific exchange with researchers from around the world allowed our team to overcome isolation of the former Soviet Union. A list of major participants of this exchange includes Professor [[Monroe Newborn|Monty Newborn]] from [[McGill University]], Canada, Professors [[Tony Marsland]] and [[Mathematician#Goebel|Randy Goebel]] from the [[University of Alberta]], Canada, Professor [[Jaap van den Herik]] from the [[Maastricht University|University of Limburg]], The Netherlands, Professor [[Ben Mittman]] from [[Northwestern University]], USA, [[David Cahlander|Dr. David Cahlander]] from CDC Corp., USA, [[Ken Thompson]] from [[Bell Laboratories|Bell Labs]], USA, [https://en.wikipedia.org/wiki/Hans_Meuer Dr. Hans Meuer] from the [https://en.wikipedia.org/wiki/University_of_Mannheim University of Mannheim], Germany, [[Hans-Jürgen Appelrath|Dr. H.-J.Appelrath]] from the [[University of Dortmund]], Germany, [[David Levy]] from London, UK.
=See also=
* [[Various Classifications#Astronomy|Astronomy]]
* [[CC Sapiens]]
=Selected Publications=
<ref>[http://ilk.uvt.nl/icga/journal/docs/References.pdf ICGA Reference Database] (pdf)</ref>
==1968 ...==
* [[Mikhail Botvinnik]] ('''1968'''). ''Algoritm igry v shakhmaty''. (The algorithm of chess)
==1970 ...==
* [[Mikhail Botvinnik]] ('''1970'''). ''[http://link.springer.com/book/10.1007/978-1-4684-6245-6 Computers, Chess and Long-Range Planning]''. [https://de.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer], [http://www.goodreads.com/book/show/1000006.Computers_Chess_and_Long_Range_Planning_ reviews from goodreads] <ref>[[Paul Rushton]], [[Tony Marsland]] ('''1973'''). ''Current Chess Programs: A Summary of their Potential and Limitations''. INFOR Journal of the Canadian Information Processing Society Vol. 11, No. 1, [http://webdocs.cs.ualberta.ca/~tony/OldPapers/Rushton-Marsland-Feb73.pdf pdf]</ref> <ref>[http://www.johnljerz.com/superduper/tlxdownloadsiteMAIN/id128.html Computers, Chess and Long-range Planning by Botvinnik] by [[John L. Jerz]]</ref>
* [[Mikhail Botvinnik]] ('''1975'''). ''O Kiberneticheskoi Celi Igri''. (On the Cybernetic Goal of Games), Soviet Radio, Moscow
: [[Boris Stilman]] ('''1975'''). ''Formirovanie Mnozestva Puchkov Traektorii''. (Formation of the Set of Trajectory Bundles) , pp. 70-78
* [[Harry Shershow]] ('''1979'''). ''On Botvinnik's Program''. [[Personal Computing#3_5|Personal Computing, Vol. 3, No. 5]], pp. 51
* [[Harry Shershow]] ('''1979'''). ''A Russian Algorithm for Chess''. [[Personal Computing#3_6|Personal Computing, Vol. 3, No. 6]], pp. 77
* Editor ('''1979'''). ''A Russian View of Chess Computers''. [[Personal Computing#3_9|Personal Computing, Vol. 3, No. 9]], pp. 64
* [[Mikhail Botvinnik]] ('''1979'''). ''O Reshenii Netochnih Prebornih Zadach''. (On Solving Inexact Search Problems), Soviet Radio, Moscow
: [[Boris Stilman]] ('''1979'''). ''Zoni Igri''. (Fields of Play). pp.70-104.
: [[Boris Stilman]], [[Michael Tsfasman]] ('''1979'''). ''Pozicionnaja Ocenka i Prioriteti''. (Positional Value and Assignment of Priorities). pp. 104
==1980 ...==
* [[Mikhail Botvinnik]], [[Boris Stilman]], [[Alexander Yudin]], [[Alexander Reznitskiy]], [[Michael Tsfasman]] ('''1980'''). ''Thinking of Man and Computer''. Proc. of the Second International Meeting on Artificial Intelligence, pp. 1-9, Repino, Leningrad, Russia.
* [[Tony Marsland]], [[Monroe Newborn|Monty Newborn]] ('''1981'''). ''A brighter future for Soviet computer chess?'' [[ICGA Journal#4_1|ICCA Newsletter, Vol. 4, No. 1]], [http://webdocs.cs.ualberta.ca/~tony/OldPapers/Marsland-Newborn-1981.pdf pdf]
* [[Mikhail Botvinnik]] ('''1982'''). ''Decision Making and Computers.'' [[Advances in Computer Chess 3]]
* [[Mikhail Botvinnik]] ('''1982'''). ''Meine neuen Ideen zur Schachprogrammierung''. Springer-Verlag, Berlin. (German)
* [[Mikhail Botvinnik]] ('''1983'''). ''The Game of Chess: Its past, present and future''. [[ICGA Journal#6_3|ICCA Journal, Vol. 6, No. 3]]
* [[Mikhail Botvinnik]] ('''1984'''). ''[http://link.springer.com/book/10.1007/978-1-4612-5204-7 Computers in Chess: Solving Inexact Search Problems]''. [https://de.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer]
: [[Michael Tsfasman]], [[Boris Stilman]] ('''1984'''). ''The Positional Estimate and Assignment of Priorities''.
==1990 ...==
* [[Alexander Reznitskiy]] ('''1990'''). ''Pioneer Approach to Chess Programming''. Praxis der Informationverarbeitung und Kommunikation, 3/90, pp. 151-157, K.G. Saur Verlag, Munich.
* [[Alexander Reznitskiy]], [[Mikhail Chudakov]] ('''1990'''). ''Pioneer: a Chess Program Modelling a Chess Master's Mind''. [[ICGA Journal#13_4|ICCA Journal, Vol. 13, No. 4]]
* [[Mikhail Botvinnik]] ('''1993'''). ''Three Positions''. [[ICGA Journal#16_2|ICCA Journal, Vol. 16, No. 2]]
* [[Mikhail Botvinnik]], [[Evgeniĭ Dmitrievich Cherevik]], [[Vasily Vladimirov]], [[Vitaly Vygodsky]] ('''1994'''). ''[https://getinfo.de/app/Solving-Shannon-s-Problem-Ways-and-Means/id/BLCP%3ACN011979464 Solving Shannon's Problem: Ways and Means]''. [[Advances in Computer Chess 7]]
* [[Boris Stilman]] ('''1994'''). ''A Linguistic Geometry of the Chess Model''. [[Advances in Computer Chess 7]], [http://www.stilman-strategies.com/bstilman/boris_papers/Jour94_CHESS7.pdf pdf draft]
* [[Marty Hirsch]] ('''1995'''). ''Botwinnik und die Schachprogrammierung''. [[Computerschach und Spiele]], June-July 1995 (German)
==2000 ...==
* [[Boris Stilman]] ('''2000'''). ''[http://atimopheyev.narod.ru/LG01pdf_in_HTML/LG01_eng.HTML Linguistic Geometry - From Search to Construction]''. Operations Research/Computer Science Interfaces Series. Springer US, ISBN: 978-0-7923-7738-2
=Forum Posts=
==1993 ...==
* [http://groups.google.com/group/rec.games.chess/browse_frm/thread/c6c81bbb1a2b399f# Kasparov missed Beautiful win; Botvinnik's Program muffs analysis] by [[Hans Berliner]], [[Computer Chess Forums|rec.games.chess]], July 9, 1993
* [https://groups.google.com/d/msg/rec.games.chess.computer/ZWQ5ZwvXx_s/EgXPrz6jZFYJ Botvinnik article] by [[Jonathan Schaeffer]], [[Computer Chess Forums|rgcc]], October 23, 1996
: [https://groups.google.com/d/msg/rec.games.chess.computer/ZWQ5ZwvXx_s/Cozl-N5kZkMJ Re: Botvinnik article] by [[Peter Gillgasch]], [[Computer Chess Forums|rgcc]], October 23, 1996
: [https://groups.google.com/d/msg/rec.games.chess.computer/ZWQ5ZwvXx_s/YGugyzFTwGYJ Re: Botvinnik article] by [[Marc-François Baudot]], [[Computer Chess Forums|rgcc]], November 07, 1996 » [[Advances in Computer Chess 7]]
* [https://groups.google.com/d/msg/rec.games.chess.computer/PfUC5qeA1wg/DM9diAkN0WMJ Botvinniks Chess Algorithm ??] by [[Bruce Moreland]], [[Computer Chess Forums|rgcc]], October 05, 1997
==2000 ...==
* [https://www.stmintz.com/ccc/index.php?id=98380 What is Botvinnik's legacy to computer chess?] by Drazen Marovic, [[CCC]], February 20, 2000
* [https://www.stmintz.com/ccc/index.php?id=101063 "The Tale of a Small Tree" by M.M.Botvinnik [fragment]] by [[José Antônio Fabiano Mendes]], [[CCC]], March 09, 2000 » [[Réti Endgame Study]]
* [https://www.stmintz.com/ccc/index.php?id=211423 Re: KAISSA for PC, I'm the proud owner] by [[Eugene Nalimov]], [[CCC]], February 01, 2002 » [[Kaissa]], [[Siberian Chess]]
==2010 ...==
* [http://immortalchess.net/forum/showthread.php?t=119 М. Ботвинник. Проект "ПИОНЕР"] by Kashchey the Deathless, [[Computer Chess Forums|immortalchess]], March 10, 2010, ([http://translate.googleusercontent.com/translate_c?depth=1&hl=en&ie=UTF8&prev=_t&rurl=translate.google.com&sl=ru&tl=en&u=http://immortalchess.net/forum/showthread.php%3Fs%3D7d0225912f40ed0d72130e802c88e9cc%26t%3D119&usg=ALkJrhg6ud8XfORqMHQaDIYcDivGaDsP_Q Botvinnik. The "Pioneer"] translated by [https://en.wikipedia.org/wiki/Google_Translate Google_Translate])
* [http://www.talkchess.com/forum/viewtopic.php?t=61372 Pioneer] by [[Henk van den Belt]], [[CCC]], September 09, 2016
=External Links=
==Chess Program==
* [http://atimopheyev.narod.ru/Frame/index.html Лингвистическая Геометрия] Бориса Штильмана, [http://translate.googleusercontent.com/translate_c?hl=de&ie=UTF8&prev=_t&rurl=translate.google.com&sl=ru&tl=en&u=http://atimopheyev.narod.ru/Frame/index.html&usg=ALkJrhjGqyvJey-MTGqcGxzMU53Od0Y7VQ Linguistic Geometry] [[Boris Stilman]] by [[Alexander Timofeev]] ([https://en.wikipedia.org/wiki/Google_Translate Google Translate])
: [http://atimopheyev.narod.ru/EncyclopediaChess/Info/index.html Энциклопедия шахмат - Ботвинник] В.Линдер, И.Линдер, [http://translate.googleusercontent.com/translate_c?hl=de&ie=UTF8&prev=_t&rurl=translate.google.com&sl=ru&tl=en&u=http://atimopheyev.narod.ru/EncyclopediaChess/Info/index.html&usg=ALkJrhiO_-nptHsoivZzGe9iRV4Fjgg47w The Encyclopedia of Chess - Botvinnik] B. Linder, J. Linder
: [http://atimopheyev.narod.ru/AfterPIONEER/index.html По стопам ПИОНЕРа], [http://translate.googleusercontent.com/translate_c?hl=de&ie=UTF8&prev=_t&rurl=translate.google.com&sl=ru&tl=en&u=http://atimopheyev.narod.ru/AfterPIONEER/index.html&usg=ALkJrhh0I8eGI93tpR27m-YIWUnG3l5SjA In the footsteps of Pioneer]
* [http://www.johnljerz.com/superduper/tlxdownloadsiteMAIN/id128.html Computers, Chess and Long-range Planning by Botvinnik] by [[John L. Jerz]]
* [http://www.computerwoche.de/heftarchiv/1978/15/1195495/ Über Stand und Entwicklung seines Computer-Schachprogramms "Pionier" referierte Prof. Michael Botwinnik (67), UdSSR, auf einer einwöchigen Vortragsreise durch die Bundesrepublik], April 04, 1978, [[Computerworld#Woche|Computerwoche]] 15/1978 (German)
* [http://www.computerwoche.de/a/pionier-ruestet-sich-zum-wettkampf,1196402 "Pionier" rüstet sich zum Wettkampf], July 21, 1978, [[Computerworld#Woche|Computerwoche]] (German)
* [http://www.computerwoche.de/a/pionier-ruestet-sich-zum-wenkampf-fortsetzung-aus-cw-nr-30,1196451 "Pionier" rüstet sich zum Wettkampf (Fortsetzung)], July 28, 1978, [[Computerworld#Woche|Computerwoche]] (German)
* [http://chess-news.ru/en/node/8210 Martin Meuer: "I Wanted to Do Something Different in Conjunction with Computers"] | [http://chess-news.ru/ chess-news.ru], June 28, 2012 <ref>Martin Meuer, son of [https://en.wikipedia.org/wiki/Hans_Meuer Hans Meuer] who worked with Botvinnik</ref>
==Misc==
* [https://en.wikipedia.org/wiki/Pioneer Pioneer from Wikipedia]
* [http://ru.wikipedia.org/wiki/%D0%9F%D0%B8%D0%BE%D0%BD%D0%B5%D1%80 Пионер — Википедия] (Russian)
* [https://en.wikipedia.org/wiki/Pioneer_program Pioneer program from Wikipedia]
* [https://en.wikipedia.org/wiki/Pioneer_anomaly Pioneer anomaly from Wikipedia]
* [https://en.wikipedia.org/wiki/Pioneer_species Pioneer species from Wikipedia]
* [https://en.wikipedia.org/wiki/Pioneer_movement Pioneer movement from Wikipedia]
: [https://en.wikipedia.org/wiki/Young_Pioneer_Organization_of_the_Soviet_Union Young Pioneer Organization of the Soviet Union - Wikipedia]
: [https://en.wikipedia.org/wiki/Young_Pioneer_camp Young Pioneer camp from Wikipedia]
: [https://commons.wikimedia.org/wiki/Category:Pioneer_movement Category:Pioneer movement - Wikimedia Commons]
* [https://en.wikipedia.org/wiki/Pioneers_Palace Pioneers Palace from Wikipedia]
* [[Videos#Can|Can]] - [https://en.wikipedia.org/wiki/Landed_(album) Unfinished], 1975, [https://en.wikipedia.org/wiki/YouTube YouTube] Video
: {{#evu:https://www.youtube.com/watch?v=9QchRNthUTo|alignment=left|valignment=top}}
=References=
<references />
'''[[Engines|Up one Level]]'''
[[FILE:Frederick McCubbin - The pioneer - Google Art Project.jpg|border|right|thumb|[[Arts#McCubbin|Frederick McCubbin]] - The pioneer, 1904 <ref>[[Arts#McCubbin|Frederick McCubbin]], The pioneer, 1904, oil on canvas, [https://en.wikipedia.org/wiki/National_Gallery_of_Victoria National Gallery of Victoria], [https://en.wikipedia.org/wiki/Melbourne Melbourne], [https://en.wikipedia.org/wiki/The_Pioneer_%28painting%29 The Pioneer (painting) from Wikipedia]</ref> ]]
'''Pioneer''', (Russian: Пионер)<br/>
was a Soviet [[Artificial Intelligence]] project headed by [[Mikhail Botvinnik]] with the aim to develop a chess program to model a Chess Master's Mind, also used as general purpose planning tool to solve [https://en.wikipedia.org/wiki/Economic_system economical] problems in the [https://en.wikipedia.org/wiki/Soviet_Union Soviet Union]. Based on a hierarchical mathematical model consisting of [[Square Control|square control]], [[Trajectory|trajectories]], sheaves of trajectories, and counter trajectories of attacking and defending pieces, piece chains, and zones, and the intermediate goal to win [[Material|material]] within a given horizon, its purpose was a [[Minimax|minimax]] [[Best-First|best-first search]] of extremely narrow but deep game trees. The name Pioneer was chosen in 1977, when the program was invited to play the [[WCCC 1977]] in Toronto. However, Pioneer was never completed in a way that it could play a [[Chess Game|game of chess]] in public under tournament conditions <ref>[https://www.stmintz.com/ccc/index.php?id=211423 Re: KAISSA for PC, I'm the proud owner] by [[Eugene Nalimov]], [[CCC]], February 01, 2002</ref>.
=Early Ideas=
Botvinnik's early ideas on [[Attack and Defend Maps|attack maps]] were already formulated and published the late 50s and 60s. At [https://en.wikipedia.org/wiki/Chess_Centres Moscow Central Chess Club] <ref>[http://en.chessbase.com/home/TabId/211/PostId/4007513 The last day of the “Botvinnik Memorial”] by [http://de.wikipedia.org/wiki/Anna_Denissowna_Burtassowa Anna Burtasova], [[ChessBase|ChessBase News]], September 07, 2011</ref> in 1966, with the skeptical [[Georgy Adelson-Velsky]] and others attending, he introduced the concept of [[Trajectory|trajectories]] and found [[Vladimir Butenko]] as supporter and collaborator. Butenko first implemented the [[Vector Attacks|15x15 vector attacks]] board representation on a [[M-20]] computer, [[Distance#15x15|determining trajectories]]. The table below demonstrates the [[Distance|distance]] from a square (here c2) on a 8x8 board, superimposed on the 15x15 array in such a way that the from square (c2) coincides with the central square of the 15x15 array, which is the origin, tail, or base of all displacement vectors <ref>[[Boris Stilman]] ('''1994'''). ''A Linguistic Geometry of the Chess Model''. [[Advances in Computer Chess 7]], [http://www.stilman-strategies.com/bstilman/boris_papers/Jour94_CHESS7.pdf pdf draft]</ref> .
<pre>
╔════╤════╤════╤════╤════╤════╤════╤════╤════╤════╤════╤════╤════╤════╤════╗
210 ║ 7 | 7 | 7 | 7 | 7 | 7 | 7 | 7 | 7 | 7 | 7 | 7 | 7 | 7 | 7 ║
╟────┼────┼────┼────┼────╔════╤════╤════╤════╤════╤════╤════╤════╗────┼────╢
195 ║ 7 | 6 | 6 | 6 | 6 ║ 6 | 6 | 6 | 6 | 6 | 6 | 6 | 6 ║ 6 | 7 ║
╟────┼────┼────┼────┼────╟────┼────┼────┼────┼────┼────┼────┼────╢────┼────╢
180 ║ 7 | 6 | 5 | 5 | 5 ║ 5 | 5 | 5 | 5 | 5 | 5 | 5 | 5 ║ 6 | 7 ║
╟────┼────┼────┼────┼────╟────┼────┼────┼────┼────┼────┼────┼────╢────┼────╢
165 ║ 7 | 6 | 5 | 4 | 4 ║ 4 | 4 | 4 | 4 | 4 | 4 | 4 | 5 ║ 6 | 7 ║
╟────┼────┼────┼────┼────╟────┼────┼────┼────┼────┼────┼────┼────╢────┼────╢
150 ║ 7 | 6 | 5 | 4 | 3 ║ 3 | 3 | 3 | 3 | 3 | 3 | 4 | 5 ║ 6 | 7 ║
╟────┼────┼────┼────┼────╟────┼────┼────┼────┼────┼────┼────┼────╢────┼────╢
135 ║ 7 | 6 | 5 | 4 | 3 ║ 2 | 2 | 2 | 2 | 2 | 3 | 4 | 5 ║ 6 | 7 ║
╟────┼────┼────┼────┼────╟────┼────┼────┼────┼────┼────┼────┼────╢────┼────╢
120 ║ 7 | 6 | 5 | 4 | 3 ║ 2 | 1 | 1 | 1 | 2 | 3 | 4 | 5 ║ 6 | 7 ║
╟────┼────┼────┼────┼────╟────┼────╔════╗────┼────┼────┼────┼────╢────┼────╢
105 ║ 7 | 6 | 5 | 4 | 3 ║ 2 | 1 ║ 0 ║ 1 | 2 | 3 | 4 | 5 ║ 6 | 7 ║
╟────┼────┼────┼────┼────╟────┼────╚════╝────┼────┼────┼────┼────╢────┼────╢
90 ║ 7 | 6 | 5 | 4 | 3 ║ 2 | 1 | 1 | 1 | 2 | 3 | 4 | 5 ║ 6 | 7 ║
╟────┼────┼────┼────┼────╚════╧════╧════╧════╧════╧════╧════╧════╝────┼────╢
75 ║ 7 | 6 | 5 | 4 | 3 | 2 | 2 | 2 | 2 | 2 | 3 | 4 | 5 | 6 | 7 ║
╟────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────╢
60 ║ 7 | 6 | 5 | 4 | 3 | 3 | 3 | 3 | 3 | 3 | 3 | 4 | 5 | 6 | 7 ║
╟────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────╢
45 ║ 7 | 6 | 5 | 4 | 4 | 4 | 4 | 4 | 4 | 4 | 4 | 4 | 5 | 6 | 7 ║
╟────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────╢
30 ║ 7 | 6 | 5 | 5 | 5 | 5 | 5 | 5 | 5 | 5 | 5 | 5 | 5 | 6 | 7 ║
╟────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────╢
15 ║ 7 | 6 | 6 | 6 | 6 | 6 | 6 | 6 | 6 | 6 | 6 | 6 | 6 | 6 | 7 ║
╟────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────┼────╢
0 ║ 7 | 7 | 7 | 7 | 7 | 7 | 7 | 7 | 7 | 7 | 7 | 7 | 7 | 7 | 7 ║
╚════╧════╧════╧════╧════╧════╧════╧════╧════╧════╧════╧════╧════╧════╧════╝
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14
</pre>
[[Boris Stilman]] gave following example to generate a set or sheave of trajectories for a king moving from f6 to h1 <ref>[[Boris Stilman]] ('''1994'''). ''A Linguistic Geometry of the Chess Model''. [[Advances in Computer Chess 7]], [http://www.stilman-strategies.com/bstilman/boris_papers/Jour94_CHESS7.pdf pdf draft]</ref> :
<pre>
D(f6,K) + D(h1,K) = SUM SUM == D(f6,h1)
5 4 3 2 2 2 2 2 7 7 7 7 7 7 7 7 c b a 9 9 9 9 9 . . . . . . . .
5 4 3 2 1 1 1 2 7 6 6 6 6 6 6 6 c a 9 8 7 7 7 8 . . . . . . . .
5 4 3 2 1 0 1 2 7 6 5 5 5 5 5 5 c a 8 7 6|5|6 7 . . . . . 1 . .
5 4 3 2 1 1 1 2 7 6 5 4 4 4 4 4 c a 8 6|5 5 5|6 . . . . 1 1 1 .
5 4 3 2 2 2 2 2 + 7 6 5 4 3 3 3 3 = c a 8 6|5 5 5 5| . . . . 1 1 1 1
5 4 3 3 3 3 3 3 7 6 5 4 3 2 2 2 c a 8 7 6|5 5 5| . . . . . 1 1 1
5 4 4 4 4 4 4 4 7 6 5 4 3 2 1 1 c a 9 8 7 6|5 5| . . . . . . 1 1
5 5 5 5 5 5 5 5 7 6 5 4 3 2 1 0 c b a 9 8 7 6|5| . . . . . . . 1
</pre>
=Mathematical Projection=
In Botvinnik's hierarchical Mathematical Projection ('''MP''') of chess as a complex system, trajectories build the lowest level of the hierarchy. The concepts of zones as intermediate level of the MP consists of a network of main trajectories conform to attacking or defending plans determined elsewhere, negation trajectories, that is opponent's counter trajectories which may block or combat the primary trajectory in time, and own supporting counter-counter trajectories. The MP controls the growth of a [[Search Tree|search tree]] inside a [[Best-First|best-first search]], and [[Pruning|prunes]] all branches forward which could not reach a goal in time. After Botvinnik introduced the concept of Zones in 1970, Butenko refused further cooperation and began to write his own [[Butenko's program|program]] <ref>[http://atimopheyev.narod.ru/Frame/index.html Лингвистическая Геометрия] Бориса Штильмана, [http://translate.googleusercontent.com/translate_c?hl=de&ie=UTF8&prev=_t&rurl=translate.google.com&sl=ru&tl=en&u=http://atimopheyev.narod.ru/Frame/index.html&usg=ALkJrhjGqyvJey-MTGqcGxzMU53Od0Y7VQ Linguistic Geometry] [[Boris Stilman]] by [[Alexander Timofeev]] ([https://en.wikipedia.org/wiki/Google_Translate Google Translate])
[http://atimopheyev.narod.ru/AfterPIONEER/index.html По стопам ПИОНЕРа], [http://translate.googleusercontent.com/translate_c?hl=de&ie=UTF8&prev=_t&rurl=translate.google.com&sl=ru&tl=en&u=http://atimopheyev.narod.ru/AfterPIONEER/index.html&usg=ALkJrhh0I8eGI93tpR27m-YIWUnG3l5SjA In the footsteps of Pioneer]</ref> .
=Further Research=
In the 70s and 80s, a team around [[Boris Stilman]], [[Alexander Yudin]], [[Alexander Reznitskiy]], [[Michael Tsfasman]], [[Vadim Mirniy]] and [[Mikhail Chudakov]] worked on Pioneer at the ''State Committee for Science and Technology'', [https://en.wikipedia.org/wiki/Moscow Moscow], [https://en.wikipedia.org/wiki/Soviet_Union USSR], the ''National Research Institute for Electrical Engineering'', Moscow, USSR and the [https://en.wikipedia.org/wiki/Russian_Academy_of_Sciences USSR Academy of Sciences], Moscow, USSR. Botvinnik and his team proposed a [[Attack and Defend Maps|attack map]] and offset map [[Move Generation|move generating]] strategy <ref>[[David Kittinger]], [[Scott McDonald]] ('''1984'''). ''Report from the U.S. Open''. [[Computer Chess Reports|Computer Chess Digest Annual 1984]] pp. 15-33</ref> based on [[Vector Attacks]] <ref>[[Boris Stilman]] ('''1994'''). ''A Linguistic Geometry of the Chess Model''. [[Advances in Computer Chess 7]], [http://www.stilman-strategies.com/bstilman/boris_papers/Jour94_CHESS7.pdf pdf draft]</ref> , and a hierarchical geometrical model based on trajectories, sheaves of trajectories and chains - a set of pieces, each with their trajectories, enjoying the property of aiding or hindering the attack of a piece against a target. Based on this research, Boris Stilman later coined the term [[Linguistic Geometry]] <ref>[http://www.stilman-strategies.com/bstilman/lgmain.html The Home Page of Linguistic Geometry]</ref> , a new type of game theory <ref>[[José Roberto Mercado Vega]], [[Zvi Retchkiman Königsberg]] ('''2009'''). ''[http://portal.acm.org/citation.cfm?id=1719355&dl=GUIDE&coll=GUIDE&CFID=77083768&CFTOKEN=17475304 Modeling the Game of Arimaa with Linguistic Geometry]''. [http://www.informatik.uni-trier.de/~ley/db/conf/cig/cig2009.html#VegaK09 CIG'09] » [[Arimaa]]</ref>. Alexander Reznitskiy and Mikhail Chudakov presented the current state of a long development originated by Botvinnik in an [[ICGA Journal#13_4|1990 ICCA Journal]] article <ref>[[Alexander Reznitskiy]], [[Mikhail Chudakov]] ('''1990'''). ''Pioneer: a Chess Program Modelling a Chess Master's Mind''. [[ICGA Journal#13_4|ICCA Journal, Vol. 13, No. 4]]</ref>.
=Controversy=
Botvinnik published abilities of Pioneer and its successor [[CC Sapiens]] on selected positions, but they never played a complete game of chess in public. For his publication ''Three Positions'' <ref>[[Mikhail Botvinnik]] ('''1993'''). ''Three Positions''. [[ICGA Journal#16_2|ICCA Journal, Vol. 16, No. 2]]</ref> , Botvinnik was heavily criticized by [[Hans Berliner]] <ref>[[Hans Berliner]] ('''1993'''). ''Playing Computer Chess in the Human Style''. [[ICGA Journal#16_3|ICCA Journal, Vol. 16, No. 3]]</ref> <ref>[http://groups.google.com/group/rec.games.chess/browse_frm/thread/c6c81bbb1a2b399f# Kasparov missed Beautiful win; Botvinnik's Program muffs analysis] by [[Hans Berliner]], [[Computer Chess Forums|rec.games.chess]], July 9, 1993</ref> <ref>[https://groups.google.com/d/msg/rec.games.chess.computer/ZWQ5ZwvXx_s/EgXPrz6jZFYJ Botvinnik article] by [[Jonathan Schaeffer]], [[Computer Chess Forums|rgcc]], October 23, 1996</ref> <ref>[http://atimopheyev.narod.ru/AfterPIONEER/info/PIONEER/2-Berliner.htm Hans Berliner against Mikhail Botvinnik] by [[Alexander Timofeev]]</ref> , and his old chess rival [[David Bronstein]] <ref>[[David Bronstein]] ('''1993'''). ''Mimicking Human Oversight''. [[ICGA Journal#16_3|ICCA Journal, Vol. 16, No. 3]]</ref> .
=Photos=
==McGill University 1977==
[[FILE:3-3.Botvinnik.McGill_University_Lecture.Montreal.1977.102645344.NEWBORN.lg.jpg|none|border|text-bottom|640px|link=http://archive.computerhistory.org/resources/still-image/Chess_temporary/still-image/]]
Botvinnik's Lecture on Pioneer at [[McGill University]] 1977 - any questions? [[Monroe Newborn|Monty Newborn]] left <ref>Photo Courtesy [[Monroe Newborn]] from [[The Computer History Museum]], [http://archive.computerhistory.org/resources/still-image/Chess_temporary/still-image/ archive.computerhistory.org - /resources/still-image/Chess_temporary/still-image/]</ref>
==Moscow 1980==
[[FILE:ReznitkiyStilmanDonskoyBotvinnikNewborn.jpg|none|border|text-bottom|640px|link=http://archive.computerhistory.org/resources/still-image/Chess_temporary/still-image/3-3.Resnitsky_Stilman_Donskoy_Botvinnik_Newborn.Moscow.1980.102645342.NEWBORN.jpg]]
[[Alexander Reznitskiy|A. Reznitskiy]], [[Boris Stilman|B. Stilman]], [[Mikhail Donskoy|M. Donskoy]] ([[Kaissa]]), [[Mikhail Botvinnik|M. Botvinnik]], [[Monroe Newborn|Monty & Amy Newborn]] <ref>[[Tony Marsland]], [[Monroe Newborn|Monty Newborn]] ('''1981'''). ''A brighter future for Soviet computer chess?'' [[ICGA Journal#4_1|ICCA Newsletter, Vol. 4, No. 1]], [http://webdocs.cs.ualberta.ca/~tony/OldPapers/Marsland-Newborn-1981.pdf pdf]</ref> <ref>[http://www.computerhistory.org/chess/full_record.php?iid=stl-430b9bbd70434 Monroe Newborn and Soviet computer chess developers in Moscow], Gift of [[Monroe Newborn]], 1980</ref> <ref>[http://en.chessbase.com/post/computer-che-pioneer-mikhail-donskoy-paes-on Computer chess pioneer Mikhail Donskoy passes on] from [[ChessBase|ChessBase News]], January 16, 2009</ref> <ref>[http://groups.google.com/group/rec.games.chess.computer/browse_frm/thread/e9f5b809a7ac0952 Kaissa & Botvinik] by [[Shay Bushinsky]], [[Computer Chess Forums|rgcc]], October 16, 1997</ref>
=Timeline=
<ref>based on [http://atimopheyev.narod.ru/AfterPIONEER/index.html По стопам ПИОНЕРа], [http://translate.googleusercontent.com/translate_c?hl=de&ie=UTF8&prev=_t&rurl=translate.google.com&sl=ru&tl=en&u=http://atimopheyev.narod.ru/AfterPIONEER/index.html&usg=ALkJrhh0I8eGI93tpR27m-YIWUnG3l5SjA In the footsteps of Pioneer], [http://atimopheyev.narod.ru/AfterPIONEER/inPIONEERsFootsteps/Chronology_of_Model.HTM Chronology]</ref>
{| class="wikitable"
|-
! 1958
| Botvinnik's idea to make computer grandmaster.
|-
! 1960
| Botvinnik's Lecture Humboldt University Berlin: "Men and machines at the chessboard."
|-
! 1961
| Article: MM Botvinnik, ''Men and machines at the chess board''. Chess in the USSR, 1961, № 3, Moscow
|-
! 1964
| Goal game of chess (Botvinnik, PIONEER , Mansurov, 2004).
|-
! 1966
| Dispute in Central Chess Club. Trajectory shapes. 15x15 table. Vladimir Butenko programs the trajectory of chess pieces
|-
! 1968
| Book: MM Botvinnik, chess algorithm , ''Nauka'', Moscow, 1968 tactical cost of pieces
|-
! 1969
| Concept of Zones
|-
! 1970
| Book: MM Botvinnik ''[http://link.springer.com/book/10.1007/978-1-4684-6245-6 Computers, Chess and Long-Range Planning]''. [https://de.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer]
|-
!
| Butenko's refusal to fruther cooperate with Botvinnik
|-
! 1972
| New Programmers: Boris Stillman and Alexander Yudin
|-
!
| Computer time on an English computer [[ICL 4-70|ICL 4/70]] (clone of [[IBM 360|IBM/360]])
|-
! 1976
| Stillman BM, ''About the formation of the playing area''. Dep. VINITI 3947-76, (also in Stillman BM, 1979 ). Stillman BM ''The tree in the zone busting game''. Dep. VINITI 3947a-76 (also in Stillman BM, 1979 ).
|-
! 1976
| Invitation to a [[WCCC 1977|second world championship of chess programs]] in Toronto, Canada.
|-
! 1977
| Chess program dubbed Pioneer
|-
! 1978
| MM Botvinnik, BM Stillman, AD Yudin ''Artificial chess master''. Bulletin of the Academy of Sciences of the USSSR, Moscow, 1978, № 4, p.82-91.
|-
! 1978
| BM Stillman ''Research-based management model of a chess game''. Technical report, VNIIE, Moscow, 1978
|-
! 1978
| Grants for computer time:
|-
!
| At [https://en.wikipedia.org/wiki/University_of_Mannheim University of Mannheim] ([https://en.wikipedia.org/wiki/Hans_Meuer Hans Meuer]) for the improvement and completion of the PIONEER project (For 0.5 year), Germany <ref>[http://chess-news.ru/en/node/8210 Martin Meuer: "I Wanted to Do Something Different in Conjunction with Computers"] | [http://chess-news.ru/ chess-news.ru], June 28, 2012</ref>.
|-
!
| At [[University of Dortmund]] ([[Hans-Jürgen Appelrath]]) for the development of AI theory of complex systems and its application to the PIONEER project (for 0.5 year), Germany.
|-
!
| From [https://en.wikipedia.org/wiki/Control_Data_Corporation Control Data Corp.] (CDC, [[David Cahlander]]) for the improvement of the PIONEER program and development of efficient methods for solving practical search problems (for 0.5 year), USA.
|-
! 1980
| MM Botvinnik, BM Stillman, AD Yudin, AI Reznitskii, MA Tsfasman ''The chess players and computers''. Preprint for the 2nd International Symposium on Artificial Intelligence, 9 pages, Repino, Leningrad, Russia, in October 1980.
|-
!
| Retired programmer: Alexander Yudin
|-
! 1980
| New developer: Mikhail Chudakov, Vadim Mirniy
|-
! 1981
| Retired programmer: Michael Tsfasman
|-
! 1981
| The grant for computer time (600 rubles)
|-
!
| From the USSR National Committee for Science and Technology for the design of new methods and software for solving complex search problems, (For 3 years, MM Botvinnik, BM Stilman, V Mirniy, AI Reznitskiy), USSR.
|-
! 1988
| Retired programmers: Vadim Mirniy and Boris Stillman
|-
! 1990
| Dismissed programmers: Alexander Reznitskiy and Mikhail Chudakov
|-
! 1990
| End of project Pioneer
|-
! 1994
| [[CC Sapiens]]
|}
=Quotes=
==Rushton and Marsland==
[[Paul Rushton]] and [[Tony Marsland]], 1973, in ''Current Chess Programs'' <ref>[[Paul Rushton]], [[Tony Marsland]] ('''1973'''). ''Current Chess Programs: A Summary of their Potential and Limitations''. INFOR Journal of the Canadian Information Processing Society Vol. 11, No. 1, [http://webdocs.cs.ualberta.ca/~tony/OldPapers/Rushton-Marsland-Feb73.pdf pdf]</ref> :
A novel idea has been proposed by Botvinnik. He believes it is important to know which pieces are able to reach a certain square or sector of the board in a set number of half-moves. In this manner it is possible to determine the pieces that one should be concerned with when planning a move and it establishes what Botvinnik calls an "horizon." Thus one could vary the horizon by changing the amount of time pieces are allowed to take in arriving at a given area. At the present time some of his ideas have been programmed, but the successful completion of a program based on Botvinnik's ideas has not yet been announced.
==David Kittinger==
[[David Kittinger]] and [[Scott McDonald]] in [[Computer Chess Reports|Computer Chess Digest Annual 1984]] on [[Novag]] [[Constellation]] <ref>[[David Kittinger]], [[Scott McDonald]] ('''1984'''). ''Report from the U.S. Open''. [[Computer Chess Reports|Computer Chess Digest Annual 1984]] pp. 15-33</ref> :
The Novag Constellation programs represent a significant evolutionary step in the development of microcomputer chess programs. The program represents the first commercial implementation of the [[Attack and Defend Maps|attack map]] / offset map move generating strategy proposed by former World Chess Champion Mikhail Botvinnik and subsequently refined by myself for faster [[Move Generation|move generation]] as pieces come off the board.
==Reznitskiy and Chudakov==
[[Alexander Reznitskiy]] and [[Mikhail Chudakov]] in [[ICGA Journal#13_4|ICCA Journal, Vol. 13, No. 4]] <ref>[[Alexander Reznitskiy]], [[Mikhail Chudakov]] ('''1990'''). ''Pioneer: a Chess Program Modelling a Chess Master's Mind''. [[ICGA Journal#13_4|ICCA Journal, Vol. 13, No. 4]]</ref>:
PIONEER has been tested on various positions. For experiments we used an [[x86|80386]] based computer running at 20 MHz. The outcome shows the approach described in its advantage as well in its disadvantage.
So far PIONEER cannot regarded as a competetive player. The program is not fast enough to play under tournament conditions. It takes up to several hours to complete a search. Moreover, we found out, PIONEER fails to find a solution in some positions (especially in endgames).
Nevertheless, fortunately in mosts cases PIONEER manages to find the strongest move. If so, the program has found this move in a human fashion. It discovers the position's essence, correctly specifies subgoals and directs its search towards these subgoals. In accordance with this, all the trees are small, narrow and deep, and contain only reasonable variations of variable depth, truncated by logical considerations.
==Boris Stilman==
[[Boris Stilman]] in ''Linguistic Geometry''. Acknowledgments <ref>[[Boris Stilman]] ('''2000'''). ''[http://atimopheyev.narod.ru/LG01pdf_in_HTML/LG01_eng.HTML Linguistic Geometry - From Search to Construction]''. Operations Research/Computer Science Interfaces Series. Springer US, ISBN: 978-0-7923-7738-2, [http://atimopheyev.narod.ru/LG01pdf_in_HTML/LG01_eng.HTML#ACKNOWLEDGMENTS Acknowledgments]</ref> :
This book was inspired by the results of long and fruitful collaboration in the 70s and 80s with Professor Mikhail Botvinnik, my research adviser and project director. At the very beginning he shaped my thinking about complex search problems. One scientist said that this unimaginably difficult work could have started because Botvinnik, a chess player, did not anticipate the difficulties of programming, while Stilman, a computer scientist, did not anticipate difficulties of playing chess. Every time when the team of researchers experienced serious problems in the development of the project PIONEER, Dr. Botvinnik used to say: “If a human chess master can make it, a computer will make it as well.” He believed in the existence of a general algorithm, or a small collection of general algorithms, used intuitively by all the chess masters and grandmasters in playing chess. Essentially, discovery, simulation and generalization of these algorithms were the goals of the project PIONEER. An attempt to construct and investigate a mathematical model based on those algorithms is the goal of this book. Alexander Yudin, Alexander Reznitskiy, Mikhail Tsfasman, Mikhail Chudakov have worked with me in the 70s and 80s to develop project PIONEER. My friend and colleague, Vadim Mirniy, with whom we worked in the 80s provided major insights and pushed our research and software implementations to much higher level. Also, in the 70s an invaluable technical assistance in software development was provided by Dmitry Lozinskiy, Lidia Poltavets, and Anatoliy Kostrukov. Four major scientists, the founders of computer science and engineering in the former Soviet Union, Academician Viktor Glushkov, Professors Bashir Rameev, Viacheslav Myasnikov and Nikolay Krinitskiy contributed to the establishment of the organizational framework, provided major funding and access to the state-of-the-art computers for project PIONEER.
Project PIONEER and the first theoretical generalizations related to the origin of LG would have never succeeded without constant support of numerous Soviet scientists. I am grateful to all of them. Here, I would like to acknowledge those whose decisive support came at the most difficult times. They are Academician Nikolay Krasovsky, Academician-correspondent, Lenin Prize Winner Yakov Tsipkin, Academician-correspondents Yury Rudenko and Hermogen Pospelov, Professors Dmitry Pospelov, David Yudin, [[Mathematician#VAYakubovich|Vladimir Yakubovich]], [[Georgy Adelson-Velsky]], Yuriy Shakarian, Gavriil Shalit, Lev Mamikoniants and [[Mikhail Donskoy|Dr. Mikhail Donskoy]].
Scientific exchange with researchers from around the world allowed our team to overcome isolation of the former Soviet Union. A list of major participants of this exchange includes Professor [[Monroe Newborn|Monty Newborn]] from [[McGill University]], Canada, Professors [[Tony Marsland]] and [[Mathematician#Goebel|Randy Goebel]] from the [[University of Alberta]], Canada, Professor [[Jaap van den Herik]] from the [[Maastricht University|University of Limburg]], The Netherlands, Professor [[Ben Mittman]] from [[Northwestern University]], USA, [[David Cahlander|Dr. David Cahlander]] from CDC Corp., USA, [[Ken Thompson]] from [[Bell Laboratories|Bell Labs]], USA, [https://en.wikipedia.org/wiki/Hans_Meuer Dr. Hans Meuer] from the [https://en.wikipedia.org/wiki/University_of_Mannheim University of Mannheim], Germany, [[Hans-Jürgen Appelrath|Dr. H.-J.Appelrath]] from the [[University of Dortmund]], Germany, [[David Levy]] from London, UK.
=See also=
* [[Various Classifications#Astronomy|Astronomy]]
* [[CC Sapiens]]
=Selected Publications=
<ref>[http://ilk.uvt.nl/icga/journal/docs/References.pdf ICGA Reference Database] (pdf)</ref>
==1968 ...==
* [[Mikhail Botvinnik]] ('''1968'''). ''Algoritm igry v shakhmaty''. (The algorithm of chess)
==1970 ...==
* [[Mikhail Botvinnik]] ('''1970'''). ''[http://link.springer.com/book/10.1007/978-1-4684-6245-6 Computers, Chess and Long-Range Planning]''. [https://de.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer], [http://www.goodreads.com/book/show/1000006.Computers_Chess_and_Long_Range_Planning_ reviews from goodreads] <ref>[[Paul Rushton]], [[Tony Marsland]] ('''1973'''). ''Current Chess Programs: A Summary of their Potential and Limitations''. INFOR Journal of the Canadian Information Processing Society Vol. 11, No. 1, [http://webdocs.cs.ualberta.ca/~tony/OldPapers/Rushton-Marsland-Feb73.pdf pdf]</ref> <ref>[http://www.johnljerz.com/superduper/tlxdownloadsiteMAIN/id128.html Computers, Chess and Long-range Planning by Botvinnik] by [[John L. Jerz]]</ref>
* [[Mikhail Botvinnik]] ('''1975'''). ''O Kiberneticheskoi Celi Igri''. (On the Cybernetic Goal of Games), Soviet Radio, Moscow
: [[Boris Stilman]] ('''1975'''). ''Formirovanie Mnozestva Puchkov Traektorii''. (Formation of the Set of Trajectory Bundles) , pp. 70-78
* [[Harry Shershow]] ('''1979'''). ''On Botvinnik's Program''. [[Personal Computing#3_5|Personal Computing, Vol. 3, No. 5]], pp. 51
* [[Harry Shershow]] ('''1979'''). ''A Russian Algorithm for Chess''. [[Personal Computing#3_6|Personal Computing, Vol. 3, No. 6]], pp. 77
* Editor ('''1979'''). ''A Russian View of Chess Computers''. [[Personal Computing#3_9|Personal Computing, Vol. 3, No. 9]], pp. 64
* [[Mikhail Botvinnik]] ('''1979'''). ''O Reshenii Netochnih Prebornih Zadach''. (On Solving Inexact Search Problems), Soviet Radio, Moscow
: [[Boris Stilman]] ('''1979'''). ''Zoni Igri''. (Fields of Play). pp.70-104.
: [[Boris Stilman]], [[Michael Tsfasman]] ('''1979'''). ''Pozicionnaja Ocenka i Prioriteti''. (Positional Value and Assignment of Priorities). pp. 104
==1980 ...==
* [[Mikhail Botvinnik]], [[Boris Stilman]], [[Alexander Yudin]], [[Alexander Reznitskiy]], [[Michael Tsfasman]] ('''1980'''). ''Thinking of Man and Computer''. Proc. of the Second International Meeting on Artificial Intelligence, pp. 1-9, Repino, Leningrad, Russia.
* [[Tony Marsland]], [[Monroe Newborn|Monty Newborn]] ('''1981'''). ''A brighter future for Soviet computer chess?'' [[ICGA Journal#4_1|ICCA Newsletter, Vol. 4, No. 1]], [http://webdocs.cs.ualberta.ca/~tony/OldPapers/Marsland-Newborn-1981.pdf pdf]
* [[Mikhail Botvinnik]] ('''1982'''). ''Decision Making and Computers.'' [[Advances in Computer Chess 3]]
* [[Mikhail Botvinnik]] ('''1982'''). ''Meine neuen Ideen zur Schachprogrammierung''. Springer-Verlag, Berlin. (German)
* [[Mikhail Botvinnik]] ('''1983'''). ''The Game of Chess: Its past, present and future''. [[ICGA Journal#6_3|ICCA Journal, Vol. 6, No. 3]]
* [[Mikhail Botvinnik]] ('''1984'''). ''[http://link.springer.com/book/10.1007/978-1-4612-5204-7 Computers in Chess: Solving Inexact Search Problems]''. [https://de.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer]
: [[Michael Tsfasman]], [[Boris Stilman]] ('''1984'''). ''The Positional Estimate and Assignment of Priorities''.
==1990 ...==
* [[Alexander Reznitskiy]] ('''1990'''). ''Pioneer Approach to Chess Programming''. Praxis der Informationverarbeitung und Kommunikation, 3/90, pp. 151-157, K.G. Saur Verlag, Munich.
* [[Alexander Reznitskiy]], [[Mikhail Chudakov]] ('''1990'''). ''Pioneer: a Chess Program Modelling a Chess Master's Mind''. [[ICGA Journal#13_4|ICCA Journal, Vol. 13, No. 4]]
* [[Mikhail Botvinnik]] ('''1993'''). ''Three Positions''. [[ICGA Journal#16_2|ICCA Journal, Vol. 16, No. 2]]
* [[Mikhail Botvinnik]], [[Evgeniĭ Dmitrievich Cherevik]], [[Vasily Vladimirov]], [[Vitaly Vygodsky]] ('''1994'''). ''[https://getinfo.de/app/Solving-Shannon-s-Problem-Ways-and-Means/id/BLCP%3ACN011979464 Solving Shannon's Problem: Ways and Means]''. [[Advances in Computer Chess 7]]
* [[Boris Stilman]] ('''1994'''). ''A Linguistic Geometry of the Chess Model''. [[Advances in Computer Chess 7]], [http://www.stilman-strategies.com/bstilman/boris_papers/Jour94_CHESS7.pdf pdf draft]
* [[Marty Hirsch]] ('''1995'''). ''Botwinnik und die Schachprogrammierung''. [[Computerschach und Spiele]], June-July 1995 (German)
==2000 ...==
* [[Boris Stilman]] ('''2000'''). ''[http://atimopheyev.narod.ru/LG01pdf_in_HTML/LG01_eng.HTML Linguistic Geometry - From Search to Construction]''. Operations Research/Computer Science Interfaces Series. Springer US, ISBN: 978-0-7923-7738-2
=Forum Posts=
==1993 ...==
* [http://groups.google.com/group/rec.games.chess/browse_frm/thread/c6c81bbb1a2b399f# Kasparov missed Beautiful win; Botvinnik's Program muffs analysis] by [[Hans Berliner]], [[Computer Chess Forums|rec.games.chess]], July 9, 1993
* [https://groups.google.com/d/msg/rec.games.chess.computer/ZWQ5ZwvXx_s/EgXPrz6jZFYJ Botvinnik article] by [[Jonathan Schaeffer]], [[Computer Chess Forums|rgcc]], October 23, 1996
: [https://groups.google.com/d/msg/rec.games.chess.computer/ZWQ5ZwvXx_s/Cozl-N5kZkMJ Re: Botvinnik article] by [[Peter Gillgasch]], [[Computer Chess Forums|rgcc]], October 23, 1996
: [https://groups.google.com/d/msg/rec.games.chess.computer/ZWQ5ZwvXx_s/YGugyzFTwGYJ Re: Botvinnik article] by [[Marc-François Baudot]], [[Computer Chess Forums|rgcc]], November 07, 1996 » [[Advances in Computer Chess 7]]
* [https://groups.google.com/d/msg/rec.games.chess.computer/PfUC5qeA1wg/DM9diAkN0WMJ Botvinniks Chess Algorithm ??] by [[Bruce Moreland]], [[Computer Chess Forums|rgcc]], October 05, 1997
==2000 ...==
* [https://www.stmintz.com/ccc/index.php?id=98380 What is Botvinnik's legacy to computer chess?] by Drazen Marovic, [[CCC]], February 20, 2000
* [https://www.stmintz.com/ccc/index.php?id=101063 "The Tale of a Small Tree" by M.M.Botvinnik [fragment]] by [[José Antônio Fabiano Mendes]], [[CCC]], March 09, 2000 » [[Réti Endgame Study]]
* [https://www.stmintz.com/ccc/index.php?id=211423 Re: KAISSA for PC, I'm the proud owner] by [[Eugene Nalimov]], [[CCC]], February 01, 2002 » [[Kaissa]], [[Siberian Chess]]
==2010 ...==
* [http://immortalchess.net/forum/showthread.php?t=119 М. Ботвинник. Проект "ПИОНЕР"] by Kashchey the Deathless, [[Computer Chess Forums|immortalchess]], March 10, 2010, ([http://translate.googleusercontent.com/translate_c?depth=1&hl=en&ie=UTF8&prev=_t&rurl=translate.google.com&sl=ru&tl=en&u=http://immortalchess.net/forum/showthread.php%3Fs%3D7d0225912f40ed0d72130e802c88e9cc%26t%3D119&usg=ALkJrhg6ud8XfORqMHQaDIYcDivGaDsP_Q Botvinnik. The "Pioneer"] translated by [https://en.wikipedia.org/wiki/Google_Translate Google_Translate])
* [http://www.talkchess.com/forum/viewtopic.php?t=61372 Pioneer] by [[Henk van den Belt]], [[CCC]], September 09, 2016
=External Links=
==Chess Program==
* [http://atimopheyev.narod.ru/Frame/index.html Лингвистическая Геометрия] Бориса Штильмана, [http://translate.googleusercontent.com/translate_c?hl=de&ie=UTF8&prev=_t&rurl=translate.google.com&sl=ru&tl=en&u=http://atimopheyev.narod.ru/Frame/index.html&usg=ALkJrhjGqyvJey-MTGqcGxzMU53Od0Y7VQ Linguistic Geometry] [[Boris Stilman]] by [[Alexander Timofeev]] ([https://en.wikipedia.org/wiki/Google_Translate Google Translate])
: [http://atimopheyev.narod.ru/EncyclopediaChess/Info/index.html Энциклопедия шахмат - Ботвинник] В.Линдер, И.Линдер, [http://translate.googleusercontent.com/translate_c?hl=de&ie=UTF8&prev=_t&rurl=translate.google.com&sl=ru&tl=en&u=http://atimopheyev.narod.ru/EncyclopediaChess/Info/index.html&usg=ALkJrhiO_-nptHsoivZzGe9iRV4Fjgg47w The Encyclopedia of Chess - Botvinnik] B. Linder, J. Linder
: [http://atimopheyev.narod.ru/AfterPIONEER/index.html По стопам ПИОНЕРа], [http://translate.googleusercontent.com/translate_c?hl=de&ie=UTF8&prev=_t&rurl=translate.google.com&sl=ru&tl=en&u=http://atimopheyev.narod.ru/AfterPIONEER/index.html&usg=ALkJrhh0I8eGI93tpR27m-YIWUnG3l5SjA In the footsteps of Pioneer]
* [http://www.johnljerz.com/superduper/tlxdownloadsiteMAIN/id128.html Computers, Chess and Long-range Planning by Botvinnik] by [[John L. Jerz]]
* [http://www.computerwoche.de/heftarchiv/1978/15/1195495/ Über Stand und Entwicklung seines Computer-Schachprogramms "Pionier" referierte Prof. Michael Botwinnik (67), UdSSR, auf einer einwöchigen Vortragsreise durch die Bundesrepublik], April 04, 1978, [[Computerworld#Woche|Computerwoche]] 15/1978 (German)
* [http://www.computerwoche.de/a/pionier-ruestet-sich-zum-wettkampf,1196402 "Pionier" rüstet sich zum Wettkampf], July 21, 1978, [[Computerworld#Woche|Computerwoche]] (German)
* [http://www.computerwoche.de/a/pionier-ruestet-sich-zum-wenkampf-fortsetzung-aus-cw-nr-30,1196451 "Pionier" rüstet sich zum Wettkampf (Fortsetzung)], July 28, 1978, [[Computerworld#Woche|Computerwoche]] (German)
* [http://chess-news.ru/en/node/8210 Martin Meuer: "I Wanted to Do Something Different in Conjunction with Computers"] | [http://chess-news.ru/ chess-news.ru], June 28, 2012 <ref>Martin Meuer, son of [https://en.wikipedia.org/wiki/Hans_Meuer Hans Meuer] who worked with Botvinnik</ref>
==Misc==
* [https://en.wikipedia.org/wiki/Pioneer Pioneer from Wikipedia]
* [http://ru.wikipedia.org/wiki/%D0%9F%D0%B8%D0%BE%D0%BD%D0%B5%D1%80 Пионер — Википедия] (Russian)
* [https://en.wikipedia.org/wiki/Pioneer_program Pioneer program from Wikipedia]
* [https://en.wikipedia.org/wiki/Pioneer_anomaly Pioneer anomaly from Wikipedia]
* [https://en.wikipedia.org/wiki/Pioneer_species Pioneer species from Wikipedia]
* [https://en.wikipedia.org/wiki/Pioneer_movement Pioneer movement from Wikipedia]
: [https://en.wikipedia.org/wiki/Young_Pioneer_Organization_of_the_Soviet_Union Young Pioneer Organization of the Soviet Union - Wikipedia]
: [https://en.wikipedia.org/wiki/Young_Pioneer_camp Young Pioneer camp from Wikipedia]
: [https://commons.wikimedia.org/wiki/Category:Pioneer_movement Category:Pioneer movement - Wikimedia Commons]
* [https://en.wikipedia.org/wiki/Pioneers_Palace Pioneers Palace from Wikipedia]
* [[Videos#Can|Can]] - [https://en.wikipedia.org/wiki/Landed_(album) Unfinished], 1975, [https://en.wikipedia.org/wiki/YouTube YouTube] Video
: {{#evu:https://www.youtube.com/watch?v=9QchRNthUTo|alignment=left|valignment=top}}
=References=
<references />
'''[[Engines|Up one Level]]'''
