Computer Chess Club Archives


Search

Terms

Messages

Subject: How Many programs can find the best move 1.Kg2! Not Qd3

Author: Jorge Pichard

Date: 12:01:15 05/10/03


One of the most spectacular wins by Alexander Alekhine occurred in his
demonstration game in Odessa in 1919 when the Civil War was raging in Russia.

A. Alekhine - I. Kaufman (Odessa, 1919): 1.d4 d5 2.Nf3 c5 3.dxc5 Nf6 4.c4 e6
5.cxd5 exd5 6.Be3 Na6 7.g3 Bxc5 8.Bxc5 Nxc5 9.Bg2 0-0 10.0-0 Bf5 11.Nc3 Re8
12.Nd4 Bg6 13.Bh3 Nce4 14.Rc1 Nxc3 15.Rxc3 Ne4 16.Rb3 Rb8 17.f4 f6 18.Rb5 Bf7
19.Rf3 a6 20.Rb4 Qa5 21.Rfb3 Qc7 22.e3 b5 23.a4 bxa4 24.Ne6 Rxb4 25.Nxc7 Rxb3
26.Nxe8 Rxb2 27.Qc1 a3 28.Qc8 Rb1+ 29.Bf1 g6 30.Nxf6+ Kg7 31.Nxe4 a2 32.Qc3+ Kh6
33.Nd6 a1Q 34.Nxf7+ Kh5.

[D]8/5N1p/p5p1/3p3k/5P2/2Q1P1P1/7P/qr3BK1 w - - 0 1

Here, however, it it White’s King who is raging the board! 35.Kg2! Rxf1 36.Kh3!
g5 37.g4+ Kg6 38.Ne5+. Black resigned.







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.