Kaissa

the famous chess program developed from 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 [|Caïssa] and won the 1st World Computer Chess Championship 1974 in Stockholm, where it ran on an IBM 360 compatible ICL 4/70. Kaissa was a quite sophisticated program for that time. It was a Shannon Type A program, using Bitboards for the internal board representation and advanced search techniques, notably already the idea of null move pruning. || toc =Photos & Games= code [Event "WCCC 1974"] [Site "Stockholm, Sweden"] [Date "1974.08.06"] [Round "2"] [White "Tech 2"] [Black "Kaissa"] [Result "0-1"]
 * Home * Engines * Kaissa**
 * [[image:Caissa.jpg link="http://en.wikipedia.org/wiki/File:Caissa.jpg"]] ||~  || **Kaissa**, (Russian: Каисса)
 * Caïssa ||~  ||^   ||
 * [[image:Kaissa_Baisley_Donskoy.jpg width="560" link="http://www.computerhistory.org/chess/full_record.php?iid=stl-430b9bbd92710"]] ||
 * Alan Baisley (left) faces Mikhail Donskoy, Round 2 WCCC 1974, Tech 2 vs Kaissa ||

1. e4 d5 2. exd5 Nf6 3. Bb5+ Bd7 4. Bc4 Bg4 5. f3 Bc8 6. Nc3 Nbd7 7. Ne4 Ne5 8. Nxf6+ exf6 9. Qe2 Qe7 10. Bb5+ c6 11. dxc6 bxc6 12. Ba4 Ba6 13. Qe4 O-O-O 14. Ne2 Bxe2 15. Kxe2 Qd7 16. d3 Re8 17. Be3 Bd6 18. c3 Bb8 19. Bc2 Ng6 20. Qb4 Nf4+ 21. Kf2 Rxe3 22. Kxe3 Nd5+ 23. Ke2 Nxb4 24. cxb4 Qd4 25. Rab1 Re8+ 26. Kf1 Qe3 27. d4 Qe2+ 28. Kg1 Qxc2 29. Kf1 Qxb1+ 30. Kf2 Qxb2+ 31. Kf1 Qe2+ 32. Kg1 Qd1+ 33. Kf2 Re2# 0-1 code
 * [[image:ArlazarovUshkovDonskoy.jpg width="560" link="http://www.computerhistory.org/chess/full_record.php?iid=stl-431f4cc15a4a7"]] ||
 * Vladimir Arlazarov, Anatoly Uskov, and Mikhail Donskoy in [|Moscow] 1980 ||
 * [[image:AdelsonVelsky.jpg width="560"link="http://www.computerhistory.org/chess/full_record.php?iid=stl-431f4cc168f00"]] ||
 * Computer chess pioneer Georgy Adelson-Velsky at chalkboard in Moscow 1980 ||
 * Computer chess pioneer Georgy Adelson-Velsky at chalkboard in Moscow 1980 ||

=Primary Authors=
 * Mikhail Donskoy
 * Georgy Adelson-Velsky
 * Vladimir Arlazarov

=Further Authors= directly working on the program :  =History of Kaissa= by Mikhail Donskoy (1999) :
 * Anatoly Uskov
 * Alexander Bitman
 * A. Baraev
 * A. Leman
 * M. Rozenfeld

Introduction


||

Official Information


||

Kaissa: The chronology of the events




|| =Kaissa for PC= In 1990, Kaissa was re-written by a 9-member team around Mikhail Donskoy to run on a PC. Kaissa played the 2nd Computer Olympiad 1990 in [|London] and became shared fourth out of eleven with four wins and two losses. GreKo author Vladimir Medvedev hosts a 1992 C|Turbo C version plus sources and manual, with kind permission given by its authors. Three excerpts, quoted from the Kaissa manual are given below, an introduction with historical background and authors mentioned, on Kaissa's Search, and Evaluation, slightly edited concerning names and links. A screenshot could be found at Meca Foro.

Introduction
from Kaissa's manual :

||

Move Selection Algorithm
Kaissa's Search : 

Evaluation
Evaluation Factors and their Weights :

Material
Material point values:
 * ~ Piece ||~  ||~ Value ||
 * King ||~  ||> 255 ||
 * Queen ||~  ||> 19 ||
 * Rook ||~  ||> 10 ||
 * Bishop ||~  ||> 7 ||
 * Knight ||~  ||> 7 ||
 * Pawn ||~  ||> 2 ||

Positional Weights
tripled pawns are evaluated as -10 || and the same rank. The three neighboring pawns, two phalangs || which is attacked by a pawn of one color and never may be attacked by a pawn of opposite color ||
 * ~ Feature ||~  ||~ Weight ||~   ||~ Remarks ||
 * Isolated pawns ||~  ||> -10 ||~   || for each pawn ||
 * Isolated pawns on semiopen files ||~  ||> -10 ||~   || for each pawn to add up to the previous point ||
 * Doubled pawns ||~  ||> -5 ||~   || for each pawn beginning with the second on the file,
 * Phalanga ||~  ||> 20 ||~   || for each Phalanga is two pawns on the neighboring files
 * Pawns in the center ||~  ||> 20 ||~   || for each square ||
 * Pawn attacks ||~  ||> 1 ||~   || for every attacked square ||
 * Pawns attacks on center ||~  ||> 10 ||~   || for every attacked square in the center ||
 * Strong Square ||~  ||> 20 ||~   || for each square, the strong square is the one,
 * Backward Pawn ||~  ||> 10 ||~   || for each pawn, these are pawns behind the strong squares ||
 * Pawn attacks adjacent to enemy king ||~  ||> 20 ||~   || for each square ||
 * Pawns blocked by enemy on F and C files ||~  ||> -50 ||~   || black pawn on f7 and c7 squares, white - on f2 and c2 squares ||
 * Pawns block on D and E files ||~  ||> -50 ||~   || black pawn on d7 and e7 squares, white - on d2 and e2 squares ||
 * Bishop/knight attacks on enemy rook/queen ||~  ||> 10 ||~   ||   ||
 * Rook on seventh rank ||~  ||> 40 ||~   ||   ||
 * Rook on seventh in endgame ||~  ||> 20 ||~   ||   ||
 * Profitable attacks on bound enemy pieces ||~  ||> 300 ||~   ||   ||
 * Double profitable attacks ||~  ||> 10 000 ||~   || on the pieces of the enemy ||
 * Bishops and knights at initial squares ||~  ||> -15 ||~   || for each piece ||
 * Knights on strong squares ||~  ||> 20 ||~   ||   ||
 * Bishops on strong squares ||~  ||> 20 ||~   ||   ||
 * Kings opposition in endgame ||~  ||> 15 ||~   ||   ||
 * Piece attacks on center ||~  ||> 10 ||~   || for each attack ||
 * Rooks on open files ||~  ||> 35 ||~   || for every rook ||
 * Rooks on semiopen files ||~  ||> 25 ||~   || for each rook ||
 * Rooks attacks on open files ||~  ||> 10 ||~   ||   ||
 * Rooks attacks on semiopen files ||~  ||> 5 ||~   ||   ||
 * Two bishops exist ||~  ||> 20 ||~   ||   ||
 * Knight and Queen exist ||~  ||> 10 ||~   ||   ||
 * Knights in the center ||~  ||> 20 ||~   ||   ||
 * Pieces attacked by bishop ||~  ||> 15 ||~   ||   ||
 * Bound pieces ||~  ||> 20 ||~   ||
 * Rooks behind passed pawns ||~  ||> 30/20 ||~   ||   ||
 * Castle right lost ||~  ||> -60 ||~   ||   ||
 * Castle made ||~  ||> 30 ||~   ||   ||
 * Bishop attacks an enemy piece ||~  ||> 15 ||~   ||   ||
 * Queen's mobility from the king square ||~  ||> -2 ||~   || It characterize king's security ||
 * Bishop/knight attacks adjacent to king ||~  ||> -10 ||~   || for each attack ||
 * Bishop/knight attacks on a strong square ||~  ||> 20 ||~   || for each attack ||
 * Pieces mobility ||~  ||> 1 ||~   || for each attack ||
 * Passed pawn blocks ||~  ||> -15 ||~   ||   ||
 * Profitable attacks on passed pawn blocks ||~  ||> 10 ||~   || for each attack ||
 * Attacks on passed pawns trajectories ||~  ||> 5 ||~   || for each attack ||
 * King distance from passed pawns in the endgame ||~  ||> -2 ||~   || for each square ||
 * King distance ||~  ||> -100 ||~   ||
 * King distance from center ||~  ||> -200 ||~   ||   ||

=See also=
 * Bitboard History
 * History of Computer Chess
 * History of Null Move Pruning
 * Kaissa from Evaluation Overlap by Mark Watkins
 * Mythology
 * Walter Faxon

=Namesakes=
 * Kaissa by Vladimir Yelin

=Publications=

1975 ...
> Chapter VIII. Kaissa
 * Georgy Adelson-Velsky, Vladimir Arlazarov, Mikhail Donskoy (**1975**). //Some Methods of Controlling the Tree Search in Chess Programs//. [|Artificial Ingelligence], Vol. 6, No. 4, pp. 361-371. Reprinted (**1988**) in [|Computer Chess Compendium]
 * Monroe Newborn (**1975**). //Computer Chess//. [|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

1980 ...

 * Mikhail Donskoy (**1980**). //From Russia with Games//. Personal Computing, Vol. 4, No. 5, pp. 77
 * Tony Marsland, Monty Newborn (**1981**). //A brighter future for Soviet computer chess?// ICCA Newsletter, Vol. 4, No. 1, [|pdf]
 * Г.М. Адельсон-Вельский, В.Л. Арлазаров, А.Р. Битман, М.В. Донской (**1983**). Машина играет в шахматы, [|pdf] (book with detailed explanations of Kaissa algorithms, language: Russian)
 * Evgenii Landis, Isaak Yaglom (**1987**). //Remembering A.S. Kronrod//. (**2002**). Translation by [|Viola Brudno], Edited by Walter Gautschi, [|ps]
 * Georgy Adelson-Velsky, Vladimir Arlazarov, Mikhail Donskoy (**1988**). //Algorithms for Games//. Springer-Verlag, New York, NY. ISBN 3-540-96629-3.
 * [|Michael Brudno] (**2000**). //Competitions, Controversies, and Computer Chess//, [|pdf]

=Forum Posts=
 * [|Kaissa & Botvinik] by Shay Bushinsky, rgcc, October 16, 1997
 * [|Re: What Chess programs existed in the '60s?] by David Blackman, CCC, April 14, 2000
 * [|KAISSA for PC, I'm the proud owner] by Joshua Lee, CCC, January 28, 2002
 * [|Markoff -- Botvinnik -- Kaissa -- Hsu -- ABC -- Berliner] by Walter Faxon, CCC, June 09, 2003
 * [|Authors of Kaissa on quiscence search] by Sergei S. Markoff, CCC, September 26, 2004 » Quiescence Search
 * [|Re: La Máquina Preservadora. Programas de Ajedrez] by Tibono, Meca Foro, October 03, 2015 (Spanish)

=External Links=

Chess Program

 * [|Kaissa's ICGA Tournaments]
 * [|Kaissa from Wikipedia]
 * [|Classic Computer Chess - ... The programs of yesteryear] by Carey, hosted by the [|Internet Archive]
 * [|KAISSA] by Bill Wall, [|Chess.com], December 29, 2011
 * [|GreKo - Download] has a Kaissa PC port in C|Turbo C from 1992, hosted by Vladimir Medvedev
 * [|"Каисса" - Историю программы рассказывает один из ее создателей Михаил Донской] - [|Kaissa] by Mikhail Donskoy, translated by [|Google Translate]
 * [|Михаил Донской: Жизненный цикл программиста - ПОЛИТ.РУ] (Russian) Mikhail Donskoy - [|The life cycle of a programmer] translated by [|Google Translate], [|polit.ru] August 20, 2008

Misc

 * [|Caissa (disambiguation) from Wikipedia]
 * [|Caïssa from Wikipedia]

=References= =What links here?= include page="Kaissa" component="backlinks" limit="100"
 * Up one Level**