Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: One of the most daring sacrifices ever played!!

Author: Tord Romstad

Date: 12:42:57 10/30/03

Go up one level in this thread


On October 30, 2003 at 14:39:42, Darren Rushton wrote:

>[D] r5k1/ppp2r1p/3p3b/3Pn3/1n2PPp1/1P2K1P1/PBB1N2q/R2Q3R b - - 0 1
>
>Does your program find 24...Rxf4!!!

As others have pointed out, the move 24... Rxf4 in itself is not hard to find.
My engine
finds it in less than a second on a PIV 2.4 GHz (in fact, this position is what
I use in the
benchmark feature in Gothmog).  However, so far no engine has shown the right
PV.
After 24... Rxf4 25. Rxh2 Rf3+ 26. Kd4, they all want to play 26... c5 instead
of the
stronger and much more beautiful move 26... Bg7! played by Nezhmetdinov.
Gothmog
doesn't find 26... Bg7 even if I let it start analysing at the position after
26. Kd4.

The really remarkable thing about this incredible game (considered by many to be
the
most beautiful chess game ever played) is of course that Nezhmetdinov must have
calculated the whole combination many moves in advance.  Perhaps Dann is right
that
he would also have found 24... Rxf4, but it is no coincidence that Nezhmetdinov
regularly reached positions where this kind of tactics is possible, while the
rest of
us (and our engines!) hardly ever do.

Tord



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.