Author: gervais
Date: 23:38:11 01/26/02
Hi, I am an amateur chess player looking for a possible upgrade from my old Pentium 166. I am using Fritz 6 as my main chess program. While looking at some classical games recently, I saw one from Fischer with a brilliant combination.(IMHO). I decided I would upgrade my system if I could be shown that current hardware/software is able to find this combination within a reasonable amount of time. [Event "US Championship"] [Site "NY USA"] [Date "1963.12.18"] [Round "3"] [White "Robert Byrne"] [Black "Robert J. Fischer"] [Result "0-1"] 1.d4 Nf6 2.c4 g6 3.g3 c6 4.Bg2 d5 5.cxd5 cxd5 6.Nc3 Bg7 7.e3 O-O 8.Nge2 Nc6 9.O-O b6 10.b3 Ba6 11.Ba3 Re8 12.Qd2 e5 13.dxe5 Nxe5 14.Rfd1 Nd3 15.Qc2 Nxf2 16.Kxf2 Ng4+ 17.Kg1 Nxe3 18.Qd2 Nxg2 19.Kxg2 d4 20.Nxd4 Bb7 21.Kf1 Qd7! (0-1) The FEN is: r2qr1k1/p4pbp/bp3np1/3p4/8/BPNnP1P1/P1Q1NPBP/R2R2K1 b - - 2 15 Think the FEN is ok.(its my first FEN!) So my question is: Can your computer find the follow-up to 15....Nxf2 right till 21....Qd7? How long does it take to see the complete sequence of moves that cause resignation? (15...Nxf2 is easy, but does it see everything up to 21...Qd7 right from the start?) Programs, Fritzmarks,processors, NPS, Ram,Mhz... Spare me no details :) Thanks and I hope to be shopping soon...
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.