Author: Dan Kiski
Date: 15:36:39 03/10/99
Go up one level in this thread
On March 10, 1999 at 17:54:57, Charles Milton Ling wrote: >On March 10, 1999 at 17:47:06, Charles Milton Ling wrote: > >>I had the opportunity to briefly discuss this beautiful move with Shirov on ICC. >> I had read in "Schach" that Be4 would also win. Shirov said, "Yes, in some 40 >>moves.". >> >I forgot to add that my Fritz 5.32 (on PII/266, 64 MB, of which 40 used for hash >tables) did not find Bh3 after 4 hours, then I had enough. >Charley > >>On March 10, 1999 at 02:33:14, Peter Kappler wrote: >> >>> >>>8/8/4kpp1/3p1b2/p6P/2B5/6P1/6K1 b - - bm Bh3; id "Topalov-Shirov Linares 98"; >>> >>> >>>Does everybody remember this game? It's from last year's Linares tournament, >>>where Shirov played a shocking bishop sacrifice in the endgame and won >>>brilliantly. I believe that post-mortem analysis proved it was the only way to >>>win. (Please correct me if this is wrong) >>> >>>I watched this game live on ICC with dozens of others, and we were all quite >>>impressed with Shirov's powers of calculation. >>> >>>This *should* be an extremely difficult problem for computers - but I'm sure >>>somebody will tell me that Hiarcs or some other commercial program can solve it >>>in 10 seconds. >>> >>>Just curious... >>> >>>--Peter To my re-collection this move was voted move of the century by BCM (British Chess Magazine) about 7 or 8 mths ago, voted on by a number of players. I think Speelman said something like of all the available moves this would be the only one to discount in normal calculation. I haven't checked but the position looks to be the one. And I do not think any program will find it, especially if you limit it to a normal move time frame as Shirov had. Dan Kiski.
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.