CC Sapiens

From Chessprogramming wiki
Jump to: navigation, search

Home * Engines * CC Sapiens

Wisdom Emblem [1]

CC Sapiens, (Chess Computer Sapiens)
a computer chess project headed by Mikhail Botvinnik during the early 90s after the dissolution of the Soviet Union. Further contributors, specially on the application of 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 trees in ICCA Journal, Vol. 16, No. 2 [2] was criticized by Hans Berliner [3] [4] and Botvinnik's old chess rival David Bronstein [5], due to obvious flaws and allegation of forged results [6].

A Muse A-Musing

Excerpt of the Editorial, ICCA Journal, Vol. 16, No. 3 by Bob Herschberg and Jaap van den Herik [7]: 

Controversy is not only not harmful, it is the only way to recognize the eventual truth which is fated to have its origin as a dispute between heretics and the current orthodoxy, the latter only recently absolved itself from the charge of heresy. It is therefore that we welcome an unusual amount of controversy arising out of the last issue of our Journal. Whether it is Botvinnik being challenged by Berliner, or by his former comrade-in-arms, Bronstein, whether it is one of your Editors taking up the cudgels against proponents of Chinese Chess-by-program, a double heresy, - all are welcome. Their discussions may not be among the most edifying of exchanges - well, neither was the language in which heresy was discussed and orthodoxy arrived at on many famous occasions, Church counsels among them.

Yet, we maintain: the discussion, even the confrontation is helpful and conducive to the health of computer chess. Following this belief, we feel a duty to extend the hospitality of our columns generously to all heretics. Caïssa, still smiling, will be amused.

Kasparov - Ribli

The first one of Botvinnik's Three Positions [8] and most criticized analysis is from the Garry Kasparov vs. Zoltán Ribli game [9], Skellefteå World Cup 1989 [10], after 26.Rxb5 Bxe3 [11] [12]:

    
    
    
    
    
    
    
    
      
     
     
       
       
      
   
       
     ♜♚ 
     ♟♟♟
♟ ♕ ♟   
 ♖      
♛       
    ♝ ♙ 
♙  ♖♙♙ ♙
      ♔ 
5rk1/5ppp/p1Q1p3/1R6/q7/4b1P1/P2RPP1P/6K1 w - -

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 rgc [13] as reply to Berliner's B* HiTech analysis with the wrong 3 ...Qf5+! 4.Kg2 line [14]. As admitted by Berliner in his Playing Computer Chess in the Human Style ICCA correspondence [15], it was possible to identify a serious bug in B* HiTech's 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 [16] [17]: 

A proposal by Shannon (1950) indicated two styles of constructing computer-chess programs: 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

Excerpt from Solving Shannon's Problem: Ways and Means: 

In the program CC Sapiens, the intermediate step of the model is identified with the analysis of a chain of pieces. An attacking piece L0 and an attacked piece L2 constitute the basis of the chain; the remaining pieces oppose or support it. Whereas a chain of pieces connects material entities, there is also, as an intermediate step, a positional chain. The latter is composed of links relating squares to specific other squares, such as holes and weak squares, and to properties enjoyed by the totality of squares and their subsets, such as ranks, files and diagonals.

See also

Selected Publications

[18]

Forum Posts

Re: Kasparov missed Beautiful win; Botvinnik's Program muffs analysis by Feng-hsiung Hsu, rec.games.chess, July 10, 1993
Re: Botvinnik article by Peter Gillgasch, rgcc, October 23, 1996

External Links

Chess Program

Misc

References

  1. ↑ Wisdom Emblem, from George Wither (1635). A Collection of Emblemes Anciente and Moderne. London, Internet Archive, Wikimedia Commons, 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'.
  2. ↑ Mikhail Botvinnik (1993). Three Positions. ICCA Journal, Vol. 16, No. 2
  3. ↑ Hans Berliner (1993). Playing Computer Chess in the Human Style. ICCA Journal, Vol. 16, No. 3
  4. ↑ Kasparov missed Beautiful win; Botvinnik's Program muffs analysis by Hans Berliner, rec.games.chess, July 9, 1993
  5. ↑ David Bronstein (1993). Mimicking Human Oversight. ICCA Journal, Vol. 16, No. 3
  6. ↑ Botvinnik article by Jonathan Schaeffer, rgcc, October 23, 1996
  7. ↑ Bob Herschberg, Jaap van den Herik (1993). A Muse A-Musing. (Editorial) ICCA Journal, Vol. 16, No. 3
  8. ↑ Mikhail Botvinnik (1993). Three Positions. ICCA Journal, Vol. 16, No. 2
  9. ↑ Garry Kasparov vs Zoltan Ribli (1989) from chessgames.com
  10. ↑ Skelleftea World Cup 1989 from chessgames.com
  11. ↑ Kasparov-Ribli, 1989 by Bruce Moreland, CCC, March 19, 1999
  12. ↑ Test position ==> Kasparov-Ribli,1989 by José Antônio Fabiano Mendes, CCC, December 14, 2001
  13. ↑ Re: Kasparov missed Beautiful win; Botvinnik's Program muffs analysis by Feng-hsiung Hsu, rec.games.chess, July 10, 1993
  14. ↑ Kasparov missed Beautiful win; Botvinnik's Program muffs analysis by Hans Berliner, rec.games.chess, July 9, 1993
  15. ↑ Hans Berliner (1993). Playing Computer Chess in the Human Style. ICCA Journal, Vol. 16, No. 3
  16. ↑ Mikhail Botvinnik, Evgeniĭ Dmitrievich Cherevik, Vasily Vladimirov, Vitaly Vygodsky (1994). Solving Shannon's Problem: Ways and Means. Advances in Computer Chess 7
  17. ↑ Claude Shannon (1949). Programming a Computer for Playing Chess.
  18. ↑ ICGA Reference Database
  19. ↑ Igor Botvinnik Has Passed Away | chess-news.ru, December 06, 2011
  20. ↑ Interview mit Igor Botvinnik, ChessBase, January 04, 2007 (German)

Up one Level

Retrieved from "https://www.chessprogramming.org/index.php?title=CC_Sapiens&oldid=22455"