Changes

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/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]]<ref>[https://www.computer-museum.ru/articles/materialy-mezhdunarodnoy-konferentsii-sorucom-2017/1733/ Five ICL computers for the Soviet Union] (Russian)</ref> <ref>[https://a-jelly.livejournal.com/429560.html IBM or ICL?] (Russian)</ref>. 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>.