Author: Ed Schröder
Date: 01:32:10 03/13/05
Go up one level in this thread
On March 12, 2005 at 23:36:56, Mike Byrne wrote: >(This position and story has been posted here before many times with one added >little twist regarding the Tasc R30} > >In 1998, GM Shrivo calculated a mate-15 in a game against Krasenkov that was >outstanding on his part. > >He wrote a nice article, in the November 1998 issue of Chess Life. > >"Even though the games are completely different (one extremely positional in >nature and the other very tctical), they had one thing in common; my >difficulties in analysing them with Fritz 5! I entered some of the lines I >calculated during the game into Fritz5 and it proved useless!." > >So far so good ... > > >"Yes, the computers can also see many more simple things than the human >GMs do, but can they compete with the best human players in depth? I am not so >sure." > >ok ... > >and then he moves to this position: > >[d] 6r1/2rp1kpp/2qQp3/p3Pp1P/1pP2P2/1P2KP2/P5R1/6R1 w - - 0 1; bm Rxg7! > > >"White would have a forced mate in 14 moves! Don't try to put this particular >position on Fritz5 or any other program, as it would never suggest 33. Rxg7+! >as the stongest move!" > >As we all know now, Shirov quite simply did not fully appreciate that there were >other programs besides Fritz would be able to solve this position. In fact, >several programs at the time (1998) found this mate in a few minutes. (Howard >Exner was the first to point this out on CC back on Nov 11, 1998. >http://chessprogramming.org/cccsearch/ccc.php?art_id=32541) > >Not only that, the Tasc R30 , programmed and built several years before this >game, sees the mate-in-15 (aggressive setting) in just 6 seconds. > >That is remarkable considering the hardware the R30 is using. It solves it in >just 24K nodes. > >The million dollar question - are there any other dedicated chess computers that >predates the Tasc R30 in solving this mate-in-15 in less than a minute? > >Also, How well do the current crop of dedicated computers do with this problem? > >R30 regards, > >Michael > >ps the problem should be way too easy for a PC program on today's hardware - if >not, something may be broken. You might want to try the Mephisto Polgar (not sure if it is able) but I think the Mephisto Risc will solve this one pretty fast as not much has changed in the long mate algorithm. New game 6r1/2rp1kpp/2qQp3/p3Pp1P/1pP2P2/1P2KP2/P5R1/6R1 w - - 0 1 Analysis by Pro Deo 1.1 1.Qxc6 Rxc6 = (0.23) Depth: 1 00:00:00 1.Kf2 +- (2.56) Depth: 1 00:00:00 1.h6 = (0.21) Depth: 1 00:00:00 1.h6 = (0.21) Depth: 3 00:00:00 1.h6 = (0.21) Depth: 3 00:00:00 1.h6 = (0.21) Depth: 3 00:00:00 1.h6 = (0.21) Depth: 3 00:00:00 1.h6 Qxd6 2.Rxg7+ Rxg7 ± (1.28) Depth: 3 00:00:00 1.h6 g5 2.Qxc6 dxc6 3.fxg5 ± (1.09) Depth: 4 00:00:00 1.h6 g5 2.Qxc6 dxc6 3.Rxg5 Rxg5 4.fxg5 ± (1.07) Depth: 5 00:00:00 1.h6 g6 2.Qxc6 Rxc6 3.Rd1 Ke7 4.Rgd2 ² (0.28) Depth: 6 00:00:00 48kN 1.h6 g6 2.Rd1 Qxd6 3.Rxd6 Rgc8 4.Rgd2 Ke7 = (0.23) Depth: 7 00:00:00 113kN 1.Qd3 Kf8 2.Kd2 Rc8 3.Kd1 a4 ² (0.27) Depth: 7 00:00:00 195kN 1.Qd3 Kf8 2.Kd2 d5 3.cxd5 Qxd5 4.Qxd5 exd5 5.Rg5 Rc3 6.Rxf5+ = (0.25) Depth: 8 00:00:00 286kN 1.h6 = (0.25) Depth: 8 00:00:00 295kN 1.h6 g6 2.Qxc6 Rxc6 3.Rd2 Ke7 4.Rgd1 Rc7 5.c5 ² (0.39) Depth: 8 00:00:00 306kN 1.h6 g6 2.Rd2 Qxd6 3.Rxd6 Rgc8 4.Rgd1 Ke8 5.R1d2 ² (0.31) Depth: 9 00:00:00 473kN 1.h6 g6 2.Rd2 Qxd6 3.Rxd6 Ra8 4.Rgd1 Ke7 5.Ke2 a4 ² (0.26) Depth: 10 00:00:01 899kN 1.Rxg7+ ² (0.26) Depth: 10 00:00:01 1287kN 1.Rxg7+ ² (0.26) Depth: 10 00:00:01 1339kN 1.Rxg7+ Rxg7 2.Rxg7+ Kxg7 3.Qe7+ Kg8 4.Qe8+ Kg7 5.h6+ Kxh6 6.Qf8+ Kh5 7.Qf7+ Kh4 8.Qxh7+ Kg3 9.Qg7+ Kh4 10.Kf2 Qb6+ 11.Kg2 Qg1+ 12.Kxg1 Rxc4 +- (#15) Depth: 10 00:00:01 2374kN (, MyTown 13.03.2005)
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.