Author: Mark Young
Date: 15:55:26 10/12/99
Go up one level in this thread
On October 12, 1999 at 08:47:57, Bernhard Bauer wrote: >Hallo, > > +---+---+---+---+---+---+---+---+ > 8 | | | | | | | *K| | > +---+---+---+---+---+---+---+---+ > 7 | | R | | | | | | | > +---+---+---+---+---+---+---+---+ > 6 | | | | | | | P | *P| > +---+---+---+---+---+---+---+---+ > 5 | | | | *R| *B| *P| | P | > +---+---+---+---+---+---+---+---+ > 4 | | P | | | | B | | | > +---+---+---+---+---+---+---+---+ > 3 | | | | | | | K | | > +---+---+---+---+---+---+---+---+ > 2 | | | | | | | | | > +---+---+---+---+---+---+---+---+ > 1 | | | | | | | | | > +---+---+---+---+---+---+---+---+ > a b c d e f g h >FEN: 6k/1R/6Pp/3rbp1P/1P3B/6K/8/8 w > >this is a position from Nisipeanu vs. Khalifman, Las Vegas, tie-break, game 2. > >Question: which program can solve this position? >IMHO no program can do, but who knows, so I ask. >G. Kasparov calls it a mutual Zugzvang position and in the variant he gives the >white rook is hold in prison. >The best move G. K. gives is Kf3 !! >Of course all the null-move programmers will call it a study and studies never >occur in real games ... >But here it happend. >Kind regards >Bernhard I don't know what info you possess to come to this opinion that no program can find Kf3, but the programs I tried found this position not hard at all. Fritz(a null-move program) found it in under 3 min, and Hiarcs found it in about 5 min. I sure other programs may find it at faster times.
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.