Concept

Kaissa

Kaissa (Каисса) was a chess program developed in the Soviet Union in the 1960s. It was named so after Caissa, the goddess of chess. Kaissa became the first world computer chess champion in 1974 in Stockholm. By 1967, a computer program by Georgy Adelson-Velsky, Vladimir Arlazarov, Alexander Bitman and Anatoly Uskov on the M-2 computer in Alexander Kronrod’s laboratory at the Institute for Theoretical and Experimental Physics had defeated Kotok-McCarthy running on the IBM 7090 at Stanford University. By 1971, Mikhail Donskoy joined with Arlazarov and Uskov to program its successor on an ICL System 4/70 at the Institute of Control Sciences. In 1972 the program played a correspondence match against readers of popular Russian newspaper, Komsomolskaya Pravda. The readers won, 11⁄2-1⁄2. It was the journalists of Komsomolskaya Pravda who gave the program its name, Kaissa. Kaissa became the first world computer chess champion in 1974 in Stockholm. The program won all four games and finished first ahead of programs "Chess 4", "Chaos" and "Ribbit", which got 3 points. After the championship, Kaissa and Chess 4 played a game, which ended in a draw. The success of Kaissa can be explained by the many innovations it introduced. It was the first program to use bitboards. Kaissa contained an opening book with 10,000 moves and used a novel algorithm for move pruning. Also it could search during the opponent's move, used null-move heuristic and had sophisticated algorithms for time management. All this is common in modern computer chess programs, but was new at that time. The last time when Kaissa participated in WCCC was its third championship, 1980 in Linz, where it finished tied for sixth to eleventh place in a field of eighteen competitors. The development of Kaissa was stopped after that due to a decision by Soviet government that the programmer's time was better spent working on practical projects. An IBM PC version of Kaissa was developed in 1990. It took fourth place in the 2nd Computer Olympiad in London in 1990.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.