25,161
edits
Changes
no edit summary
'''Kaissa''', (Russian: Каисса)
the famous chess program developed from [[Timeline#1970|1970]] at the Moscow [[Institute of Control Sciences]] by a group of researchers around [[Mikhail Donskoy]] and authors of the former [[ITEP Chess Program]]. In 1972 it was named after the goddess of chess [https://en.wikipedia.org/wiki/Caissa Ca%C3%AFssa Caïssa] and won the [[WCCC 1974|1st World Computer Chess Championship]] 1974 in Stockholm, where it ran on an [[IBM 360]] compatible [[ICL 4-70|ICL 4/70]]. Kaissa was a quite sophisticated program for that time. It was a [[Type A Strategy|Shannon Type A program]], using [[Bitboards]] for the internal [[Board Representation|board representation]] and advanced search techniques, notably already the idea of [[Null Move Pruning|null move pruning]] <ref>[[Georgy Adelson-Velsky]], [[Vladimir Arlazarov]], [[Mikhail Donskoy]] ('''1975'''). ''Some Methods of Controlling the Tree Search in Chess Programs''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 6, No. 4, pp. 361-371. Reprinted ('''1988''') in [[Computer Chess Compendium]]</ref> <ref>[[Georgy Adelson-Velsky]], [[Vladimir Arlazarov]], [[Mikhail Donskoy]] ('''1977'''). ''On the Structure of an Important Class of Exhaustive Problems and Methods of Search Reduction for them''. [[Advances in Computer Chess 1]].</ref>.
=Photos & Games=
[[File:Kaissa_Baisley_Donskoy.jpg|none|border|text-bottom|560px|link=http://www.computerhistory.org/chess/full_record.php?iid=stl-430b9bbd92710]]
[[Alan Baisley]] (left) faces [[Mikhail Donskoy]], Round 2 [[WCCC 1974]], [[Tech|Tech 2]] vs [[Kaissa]] <ref>[http://www.computerhistory.org/chess/full_record.php?iid=stl-430b9bbd92710 Kaissa at the 1st World Computer Chess Championship in Stockholm], Photo by [[Monroe Newborn]], [[The Computer History Museum]]</ref>
<pre>
</pre>
[[File:ArlazarovUshkovDonskoy.jpg|none|border|text-bottom|560px|link="http://www.computerhistory.org/chess/full_record.php?iid=stl-431f4cc15a4a7]]
[[Vladimir Arlazarov]], [[Anatoly Uskov]], and [[Mikhail Donskoy]] in [https://en.wikipedia.org/wiki/Moscow Moscow] 1980 <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-431f4cc15a4a7 Arlazarov, Uskov, and Donskoy in Moscow 1980], Gift of [[Monroe Newborn]], [[The Computer History Museum]]</ref>
[[File:AdelsonVelsky.jpg|none|border|text-bottom|560px|link=http://www.computerhistory.org/chess/full_record.php?iid=stl-431f4cc168f00]]
Computer chess pioneer [[Georgy Adelson-Velsky]] at chalkboard in Moscow 1980 <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-431f4cc168f00 Computer chess pioneer Adelson-Velsky at chalkboard in Moscow 1980], Photo by [[Monroe Newborn]], [[The Computer History Museum]]</ref>
==Kaissa: The chronology of the events==
[[Timeline#1963|1963]] (1961) - beginning of the works on the first Soviet chess program in the [[Institute of Theoretical and Experimental Physics]] (ITEP) in the laboratory under [[Alexander Kronrod|Alexander Kronrod's]] management. The first authors - [[Georgy Adelson-Velsky]], [[Vladimir Arlazarov]], [[Alexander Bitman]], [[Alexander Zhivotovsky]], [[Anatoly Uskov]], A. Leman, M. Rozenfeld.
[[Timeline#1967|1967]] - first international match of chess programs. Competed the program ITEP and the program of [[Stanford University]], made under the management [[John McCarthy]]. McCarthy is famous fact that in 1952 on the beach in San Diego together with [[Alan Turing]] devised the word combination of "Artificial Intelligence", and fact that he is the author of the language Lisp - the first programming language, specially created for the tasks in the problems of artificial intelligence. Regulations of the [[Stanford-ITEP Match|match]] - four games. From the side of Stanford played one and the same version, from the ITEP side - two, which were being distinguished by the depth of search. Moves were transferred by the telegraph once a week (this to those- that times from "yadernogo" institute!). Match continued entire year and ended with the score the 3:1 in favor of ITEP.
[[Timeline#1969|1969]] (1968) - a [https://ru.wikipedia.org/wiki/%D0%9F%D0%B8%D1%81%D1%8C%D0%BC%D0%BE_%D0%B4%D0%B5%D0%B2%D1%8F%D0%BD%D0%BE%D1%81%D1%82%D0%B0_%D0%B4%D0%B5%D0%B2%D1%8F%D1%82%D0%B8 letter ] in support of mathematician [https://en.wikipedia.org/wiki/Alexander_Esenin-Volpin Esenin-Volpin] (son of [https://en.wikipedia.org/wiki/Sergei_Yesenin poet]) and his incorrect psychiatric confinement, among others signed by [[Alexander Kronrod]] and [[Georgy Adelson-Velsky]]. As a result, the laboratory was disbanded and its major portion under [[Vladimir Arlazarov|Vladimir Arlazarov's]] management, but without Kronrod, after a certain time he settled in [[Institute of Control Sciences]] (ICF).
[[Timeline#1970|1970]] - the mechanic mathematical department of [[Moscow State University|MGU]] finished the entire group of the students of [[Alexander Kronrod]] and [[Georgy Adelson-Velsky]], that was being occupied in the famous seminar for discrete algorithms. Sums of the seminar:
| for each square, the strong square is the one, which is attacked by a pawn of one color and never may be attacked by a pawn of opposite color <ref>Not every square of the board may be the strong one. The squares which may be strong for the White are the following: b6, b7, c5, c6, c7, d5, d6, d7, e5, e6 ,e7, f5, f6, f7, g6, g7. For the Black the symmetry holds</ref>
|-
| style="text-align:right;" | 10
| for each pawn, these are pawns behind the strong squares
| [[Rook on Open File|Rooks on semiopen files]]
| style="text-align:right;" | 25
| for each rook ||
|-
| Rooks attacks on open files
|
|-
| [[Castling rightsRights|Castle right]] lost
| style="text-align:right;" | -60
|
| Pieces [[Mobility|mobility]]
| style="text-align:right;" | 1
| for each attack ||
|-
| [[Passed Pawn|Passed pawn]] [[Blockade of Stop|blocks]]
* [[Null Move Pruning#History|History of Null Move Pruning]]
* [[Evaluation Overlap#Kaissa|Kaissa]] from [[Evaluation Overlap]] by [[Mark Watkins]]
* [[Walter Faxon]]
=Publications=
==1970 ...==
* [[Georgy Adelson-Velsky]], [[Vladimir Arlazarov]] ('''1974'''). ''Methods of strengthening chess programs.'' in Problems of Cybernetic, No. 29 , pp. 167-168
: [[Georgy Adelson-Velsky|Г.М. Адельсон-Вельский]], [[Vladimir Arlazarov|В.Л. Арлазаров]] ('''1974'''). ''Методы усиления шахматных программ.''/ Сб. Проблемы кибернетики №29, стр. 167-168
* [[Mikhail Donskoy]] ('''1974'''). ''About the program playing chess.'' in Problems of Cybernetic, No. 29 , pp. 169-200
: [[Mikhail Donskoy|М.В. Донской]] ('''1974'''). ''О программе играющей в шахматы.''/ Сб. Проблемы кибернетики №29, стр. 169-200
* [http://www.mathnet.ru/php/person.phtml?option_lang=eng&personid=96114 Ya. Yu. Gol'fand], [[Aaron L. Futer]] ('''1974'''). ''Implementation of the opening book for the chess program.'' in Problems of Cybernetic, No. 29 , pp. 201-210
: Я.Ю. Гольфанд, [[Aaron L. Futer|А.Л. Футер]] ('''1974'''). ''Реализация дебютной справочной для шахматной программы.''/ Сб. Проблемы кибернетики №29, стр. 201-210
* [[Edward Komissarchik]], [[Aaron L. Futer]] ('''1974'''). ''On the analysis of the queen endgame using a computer.'' in Problems of Cybernetic, No. 29 , pp. 211-220
: [[Edward Komissarchik|Э.А. Комиссарчик]], [[Aaron L. Futer|А.Л. Футер]] ('''1974'''). ''Об анализе ферзевого эндшпиля при помощи ЭВМ.''/ Сб. Проблемы кибернетики №29, стр. 211-220, English translation by [[Christian Posthoff]], revised in [[ICGA Journal#9_4|ICCA Journal, Vol. 9, No. 4]]
* R. Guter, [[Mikhail Donskoy]] ('''1974'''). ''The machine plays chess.'' in [https://en.wikipedia.org/wiki/Kvant_(magazine) Kvant], No. 11, 12, pp. 17-22, 34-38
: Р.С. Гутер, [[Mikhail Donskoy|М.В. Донской]] ('''1974'''). ''Машина играет в шахматы.'' в журн. [https://en.wikipedia.org/wiki/Kvant_(magazine) Квант] № 11, 12, стр. 17-22, 34-38
* [[Mikhail Donskoy]], V. Khenkin ('''1974'''). ''Stockholm evenings. The nights of Kaissa.'' in [https://en.wikipedia.org/wiki/64_(magazine) 64], No. 33, pp. 4-7
: [[Mikhail Donskoy|М.В. Донской]], В. Хенкин ('''1974'''). ''Стокгольмские вечера. Ночи Каиссы.'' в журн. [https://en.wikipedia.org/wiki/64_(magazine) 64] № 33, стр. 4-7
* V. Tumanov, [https://en.wikipedia.org/wiki/Yuri_Averbakh Yuri Averbakh] ('''1974'''). ''The tale has come true.'' [https://en.wikipedia.org/wiki/Shakhmaty_v_SSSR Shakhmaty v SSSR], No. 10, 16–17
: В. Туманов, [https://en.wikipedia.org/wiki/Yuri_Averbakh Ю. Авербах] ('''1974'''). ''Сказка стала былью.'' [https://en.wikipedia.org/wiki/Shakhmaty_v_SSSR Шахматы в СССР] № 10, 16–17
==1975 ...==
* V. Khenkin ('''1975'''). ''Kaissa is the world champion.'' in [https://en.wikipedia.org/wiki/Nauka_i_Zhizn Nauka i Zhizn], No. 1, pp. 118-124
: В. Хенкин ('''1975'''). ''"Каисса" - чемпион мира.'' в журн. [https://en.wikipedia.org/wiki/Nauka_i_Zhizn Наука и жизнь], № 1, стр. 118-124
* [[Georgy Adelson-Velsky]], [[Vladimir Arlazarov]], [[Mikhail Donskoy]] ('''1975'''). ''Some Methods of Controlling the Tree Search in Chess Programs''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Ingelligence], Vol. 6, No. 4, pp. 361-371. Reprinted ('''1988''') in [[Computer Chess Compendium]] <ref>[http://www.stmintz.com/ccc/index.php?id=19469 Method of Analogies??] by Bruce Cleaver, [[CCC]], May 29, 1998</ref>
* [[Monroe Newborn]] ('''1975'''). ''Computer Chess''. [https://en.wikipedia.org/wiki/Academic_Press Academic Press], New York, N.Y. ISBN 0-125-17250-8.
* [[Georgy Adelson-Velsky]], [[Vladimir Arlazarov]], [[Mikhail Donskoy]] ('''1977'''). ''On the Structure of an Important Class of Exhaustive Problems and Methods of Search Reduction for them''. [[Advances in Computer Chess 1]]
* [[Peter Jennings]] ('''1978'''). ''The Second World Computer Chess Championships - Where KAISSA Founders on a Bug and CHESS 4.6 Conquers All''. » [[WCCC 1977]], [[Chess (Program)|Chess]]
* [[Georgy Adelson-Velsky]], [[Vladimir Arlazarov]], [[Mikhail Donskoy]] ('''1978'''). ''Chess game programming.'' in [https://en.wikipedia.org/wiki/Herald_of_the_Russian_Academy_of_Sciences Herald of the RAoS], No. 4 , pp. 82-91, [https://www.ras.ru/FStorage/download.aspx?Id=6ec533b1-a7f6-42a7-82bd-48dffec3ea0d doc]
: [[Georgy Adelson-Velsky|Г.М. Адельсон-Вельский]], [[Vladimir Arlazarov|В.Л. Арлазаров]], [[Mikhail Donskoy|М.В. Донской]] ('''1978'''). ''Программирование шахматной игры.''/ Сб. [https://en.wikipedia.org/wiki/Herald_of_the_Russian_Academy_of_Sciences Вестник РАН], №4, стр. 82-91, [https://www.ras.ru/FStorage/download.aspx?Id=6ec533b1-a7f6-42a7-82bd-48dffec3ea0d doc]
==1980 ...==
* [[Mikhail Donskoy]] ('''1980'''). ''From Russia with Games''. [[Personal Computing#4_5|Personal Computing, Vol. 4, No. 5]], pp. 77
* [[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]
* [[Georgy Adelson-Velsky|Г.М. Адельсон-Вельский]], [[Vladimir Arlazarov|В.Л. Арлазаров]], [[Alexander Bitman|А.Р. Битман]], [[Mikhail Donskoy|М.В. Донской]] ('''1983'''). ''Машина играет в шахматы''. [http://genes1s.net/files/kaissa.pdf pdf] (book with detailed explanations of Kaissa algorithms, language: Russian)
* [[Mathematician#Landis|Evgenii Landis]], [[Mathematician#Yaglom|Isaak Yaglom]] ('''1987'''). ''Remembering A.S. Kronrod''. ('''2002'''). Translation by Viola Brudno, Edited by [http://www.cstranslatorscafe.purdue.educom/people/faculty/wxgcafe/ member16949.htm Viola Brudno], Edited by [[Mathematician#WaGautschi|Walter Gautschi]], [httphttps://dipwww.suncs.ac.za/%7Elaurie/sccm00-01.ps.gz zipped ps], [http://sccm.stanfordpurdue.edu/pubhomes/sccmwxg/sccm00-01Kronrod.ps.gz zipped ps]* [[Georgy Adelson-Velsky]], [[Vladimir Arlazarov]], [[Mikhail Donskoy]] ('''1988'''). ''[https://link.springer.com/book/10.1007%2F978-1-4612-3796-9 Algorithms for Games]''. [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer-Verlag, New York, NY. ISBN 3-540-96629-3]
* [http://www.cs.toronto.edu/%7Ebrudno/ Michael Brudno] ('''2000'''). ''Competitions, Controversies, and Computer Chess'', [http://www.cs.toronto.edu/%7Ebrudno/essays/cchess.pdf pdf]
=Forum Posts=
* [httphttps://groups.google.com/groupd/msg/rec.games.chess.computer/browse_frm/thread6fW4CaesCVI/e9f5b809a7ac0952 LCQcjEpaI4kJ Kaissa & Botvinik] by [[Shay Bushinsky]], [[Computer Chess Forums|rgcc]], October 16, 1997
* [http://www.stmintz.com/ccc/index.php?id=105999 Re: What Chess programs existed in the '60s?] by [[David Blackman]], [[CCC]], April 14, 2000
* [http://www.stmintz.com/ccc/index.php?id=210429 KAISSA for PC, I'm the proud owner] by Joshua Lee, [[CCC]], January 28, 2002
=References=
<references />
'''[[Engines|Up one Level]]'''[[Category:EnginesMainframe]][[Category:Namesake]]
[[Category:Mythology]]
