25,161
edits
Changes
no edit summary
'''[[Main Page|Home]] * [[Engines]] * CC Sapiens'''
[[FILE:Wither - Emblem Wisdom.jpg|border|right|thumb| Wisdom Emblem <ref>[httphttps://commons.wikimedia.org/wiki/File:Wither_-_Emblem_Wisdom.jpg Wisdom Emblem], from [https://en.wikipedia.org/wiki/George_Wither George Wither] ('''1635'''). ''[https://archive.org/details/collectionofembl00withe A Collection of Emblemes Anciente and Moderne]''. London, [https://en.wikipedia.org/wiki/Internet_Archive Internet Archive], [https://en.wikipedia.org/wiki/Wikimedia_Commons Wikimedia Commons], [http://simple.wikipedia.org/wiki/Wisdom Wisdom from Wikipedia.simple]: The words of this old print read, in modern English: 'He over all the stars does reign That unto wisdom can attain', in other words: 'Whoever can become wise will rule over everything'.</ref> ]]
'''CC Sapiens''', (Chess Computer Sapiens)<br/>
a computer chess project headed by [[Mikhail Botvinnik]] during the early 90s after the [https://en.wikipedia.org/wiki/Dissolution_of_the_Soviet_Union dissolution of the Soviet Union]. Further contributors, specially on the application of [https://en.wikipedia.org/wiki/Economic_planning economic planning] (EC Sapiens) were mathematician [[Vasily Vladimirov]], and the economists [[Evgeniĭ Dmitrievich Cherevik]] and [[Vitaly Vygodsky]].
CC Sapiens was a trial to resurrect the [[Pioneer]] project with the aim to develop a chess program to model a Chess Master's Mind - ultimately terminated with Botvinnik's death in May 1995. Botvinnik's attempt to demonstrate the ability of CC Sapiens on three selected positions with narrow [[Search Tree|search trees]] in [[ICGA Journal#16_2|ICCA Journal, Vol. 16, No. 2]] <ref>[[Mikhail Botvinnik]] ('''1993'''). ''Three Positions''. [[ICGA Journal#16_2|ICCA Journal, Vol. 16, No. 2]]</ref> was 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>[httphttps://groups.google.com/groupd/msg/rec.games.chess/browse_frm/threadxsgbuxorOZ8/c6c81bbb1a2b399f# 83d0wqxy-VoJ Kasparov missed Beautiful win; Botvinnik's Program muffs analysis] by [[Hans Berliner]], [[Computer Chess Forums|rec.games.chess]], July 9, 1993</ref> and Botvinnik's old chess rival [[David Bronstein]] <ref>[[David Bronstein]] ('''1993'''). ''Mimicking Human Oversight''. [[ICGA Journal#16_3|ICCA Journal, Vol. 16, No. 3]]</ref>, due to obvious flaws and allegation of forged results <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>.
=A Muse A-Musing=
CC Sapiens produced an analysis of a mere 18 nodes, and determined that this position is a win for White with Rd8. Botvinnik gives one variation with 1.Rd8! Qxb5 2.Qd6! Bxf2 3.Kxf2 Re8 4.Qe7, satisfying the stated goal, but missed to consider other alternatives of Black's first (1... Bxf2) and third move. Berliner: "Presumably the beckoning 3. ...Qf5+ is dismissed since it can't possibly lead to a win for Black. Botvinnik knows that, and I know that, but can a computer program figure this out without searching?". The blunder 4.Qe7 was apparently discovered by Botvinnik or his team just before press time, given in a footnote, but due to mistake of the editors, three pages apart.
[[Feng-hsiung Hsu]], who already analyzed the position with [[Deep Thought]] along with [[Garry Kasparov]] in 1990, posted the winning lines of 3. ... Re8 4.a4 or more difficult 3 ...Qf5+! 4.Kg1! in [[Computer Chess Forums|rgc]] <ref>[https://groups.google.com/d/msg/rec.games.chess/xsgbuxorOZ8/nZWR2BkOlFsJ Re: Kasparov missed Beautiful win; Botvinnik's Program muffs analysis] by [[Feng-hsiung Hsu]], [[Computer Chess Forums|rec.games.chess]], July 10, 1993</ref> as reply to Berliner's [[B*]] [[HiTech]] analysis with the wrong 3 ...Qf5+! 4.Kg2 line <ref> [httphttps://groups.google.com/groupd/msg/rec.games.chess/browse_frm/threadxsgbuxorOZ8/c6c81bbb1a2b399f# 83d0wqxy-VoJ Kasparov missed Beautiful win; Botvinnik's Program muffs analysis] by [[Hans Berliner]], [[Computer Chess Forums|rec.games.chess]], July 9, 1993</ref>. As admitted by Berliner in his ''Playing Computer Chess in the Human Style'' [[ICCA]] correspondence <ref> [[Hans Berliner]] ('''1993'''). ''Playing Computer Chess in the Human Style''. [[ICGA Journal#16_3|ICCA Journal, Vol. 16, No. 3]]</ref>, it was possible to identify a serious bug in B* HiTech's [[Search|search]] algorithm thanks to Hsu's information.
=Solving Shannon's Problem=
==Abstract==
from ''Solving Shannon's Problem: Ways and Means'', [[Advances in Computer Chess 7]], July 01, 1993 <ref> [[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]]</ref> <ref>[[Claude Shannon]] ('''1949'''). ''[httphttps://www.pi.infn.it/%7Ecarosi~carosi/chess/shannon.txt Programming a Computer for Playing Chess]''. [http://archive.computerhistory.org/projects/chess/related_materials/text/2-0%20and%202-1.Programming_a_computer_for_playing_chess.shannon/2-0%20and%202-1.Programming_a_computer_for_playing_chess.shannon.062303002.pdf pdf]</ref>: A proposal by [[Claude Shannon|Shannon]] (1950) indicated two styles of constructing computer-chess programs: [[Brute-Force|brute-force]] and following the experience of chess masters. Of the first style examples abound, of the second only CC Sapiens, as yet incomplete, exists. From the experience with CC Sapiens and its economical analogue, it is confidently predicted that methods based on making the computer ''understand'' the problem may well gain the upper hand, both in computer chess and in high-dimensional search programs related to it, following the master's style.
==Chains==
