Author: Gian-Carlo Pascutto
Date: 10:06:50 11/02/01
Go up one level in this thread
On November 02, 2001 at 12:25:30, ALI MIRAFZALI wrote: >These two very interesting examples has caught my attention recently; >As readers are well aware very few combinations occuring in games between >master players are beyond the reach of computer analysis.Both these positions >were tested on a 500 Mhz Computer running chessmaster 8000 and Fritz6 for 24 >hours with no result. Here is the backround and games in which the positions >have occured. In the game John Donaldson (White) vs Welling,G >(Hertogenbosch 1999) After 1.Nf3 f5 2.g3 b6 3.Bg2 Bb7 4.0-0 Nf6 5.d4 g6 6.c4 Bg7 >7.Nc3 Ne4 8.Nxe4 Bxe4 9.b3 0-0 10.Bb2 e6 11.Qd2 Qf6 12.Ne1 Bxg2 13.Nxg2 Nc6 >14.Rad1 Nd8 15.Qc2 Nf7 16.c5 c6 17.Nf4 bxc5 18.Qxc5 Rfb8 19.Nd3 Qd8 20.Qc2 a5 >21.Nc5 Qe7 22.Rfe1 Rf8 23.Na4 f4 24.Qc5 Qd8 25.Kg2 Rb8 26.Nc3 Ng5 27.Ba3 Rf5 >28.Qc4 d5 29.Qd3 e5 30.dxe5 Bxe5 31.f3 fxg3 32.hxg3 Black found the amazing >32....Bxg3!!! This is the move that the above mentioned programs were not >able to find even after 24 hours .For the record the game ended 33.Kxg3 Nxf3!!! >34.exf3 Qg5+ 35.Kf2 Qh4+ 36.Ke3 Qf4+ 37.Kf2 Qh2+ 38.Ke3 Re8+ 39.Ne4 Rxe4+ >White Resigned. > Fritz 7 refutes the first combination as follows: Bxg3 Kxg3 Nxf3 Qxf5! and white is better off than before the sac So, no program will ever find the combination, because it's most likely flawed. -- GCP
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.