Author: Paulo Soares
Date: 03:36:52 09/08/00
Go up one level in this thread
On September 08, 2000 at 01:05:22, Howard Exner wrote: >A nice win by Gelfand. >3k4/2pP2b1/3p2P1/1K1P1BP1/8/8/8/8 w - - > > > id Gelfand,B - Ye Jiangchuan; bm Kc6; > >In the game Gelfand played Kc6 and Ye Jiangchuan resigned. >The winning technique as explained on Kasparov's site explains >that white's bishop must go to either a4 or e8, allowing the white king to >penetrate via the f5 square. Both work nicely, yet it made me wonder if computer >programs will discover this winning technique. How do programs >fair here? The theme of first protecting the d7 pawn with the king, then >with the bishop(on a4 or e8), and finally marching the king around to the >kingside may prove difficult for programs. I analyzed the final position with program help and I didn't get to see the win, and I got to think that Gelfand had won in the time(clock). Only now, after reading your post, I got to understand the position and I could evaluate Gelfand brilliant idea in this endgame. I think this position it's hard for programs. Paulo Soares, from Brazil
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.