Author: John Merlino
Date: 19:46:36 04/06/03
Go up one level in this thread
On April 06, 2003 at 18:48:05, Jorge Pichard wrote:
>This move was taken from this game played between Efim D. Bogoljubow (2700) -
>Alexander A. Alekhine (2735)
>
>[D]R3qr1k/2pb2p1/5n1p/5p2/1pPPpP1P/2QnP1P1/3N2R1/3N2KB b - - 0 1
>
>This is the continuation : How many programs would play 30...bxc3!! ?
>
>30. Rxa8 bxc3 31. Rxe8 {[%eval -212,17] [%emt 0:01:33]} c2 32. Rxf8+ {
>[%eval -194,13] [%emt 0:00:05]} Kh7 33. Nf2 c1=Q+ 34. Nf1 Ne1 35. Rh2 Qxc4 36.
>Rb8 Bb5 *
>
>http://www.geocities.com/lifemasteraj/bogo-alek1.html
It's definitely one of the great moves (and games) of all time. However, the
main reason that computers can't find it (today) is that Qxa8 also wins, as the
quote from Kasparov says in the article you link to:
"30...Qxa8 31.Qb3 (Or 31.Qc2 Ne1; "-/+") 31...Qa1 32.Qb1 Ra8 "-/+" would have
forced White's resignation in a few moves. But Alekhine was not satisfied with
this prosaic demolition - he was after something immortal!"
For Chessmaster 9000 to get a higher eval than off the root position (which was
about +2.1 for Black), I had to force FIFTEEN moves from the actual game, and
even then it took a depth 12 search (which took 46 seconds on my P3-733).
jm
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.