Author: Gian-Carlo Pascutto
Date: 08:21:04 01/05/02
Go up one level in this thread
On January 05, 2002 at 11:04:07, Dieter Buerssner wrote: >On January 05, 2002 at 10:24:35, Gian-Carlo Pascutto wrote: > >>Hmm, too easy :) > >You think this. It seems Shirov did not agree with you at some time. At dejanews >I found this by Richard A Fowell: > >Certainly, Shirov put his foot in it when he said that computers wouldn't >find the forced mate in: > >6r1/2rp1kpp/2qQp3/p3Pp1P/1pP2P2/1P2KP2/P5R1/6R1 w - - id "Shirov 1"; bm Rxg7; > >Also CM4000 is cited to find it in 2 seconds. This illustrates that GM's do not really know much about Chess computers I guess, though perhaps that has improved by now. The sequence consists of a series of checks chasing the black king, which has very limited options, into a position where it can be mated. This is relatively easy for a chessprogram to lock on to, and this is also why I am not surprised ChessMaster is faster here, as it is optimized for such situations. The fact that Sjeng's normal search finds the mate pretty fast (faster than the matefinder) is a good indication the matefinder is not going to be particularly fast on the position, of course. -- GCP
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.