Author: Uri Blass
Date: 15:26:48 02/08/02
Go up one level in this thread
On February 08, 2002 at 18:10:27, Uri Blass wrote: >On February 08, 2002 at 17:44:38, Gian-Carlo Pascutto wrote: > >>On February 08, 2002 at 16:05:22, ALI MIRAFZALI wrote: >> >>>Needless to say finding >>>such positions is no easy matter ;because it requires many hours (days;Months) >>>of research. >> >>What a coincidence then. It was posted here before. If I remember the analysis >>correctly, there are alternate solutions. >> >>-- >>GCP > >If you are interested in a correct hard problem then you can look at >http://www.it.ro/ccc_search/ccc.php?art_id=34455 > >No program could find Nxf2 at that time but maybe programs got better > >Uri Here is the position: [D]r2q1rk1/ppp1b1pp/2n5/3p1p2/3Pn1b1/2PB4/PPQN1PPP/RNB1R1K1 b - - 0 1 2 questions: 1)how much time do your program need to find Nxf2 2)How much time does it needs to find that black wins after Nxf2 Kxf2 Bh4+ g3 f4? I believe that Nxf2 is the only move that wins material but I may be wrong. I am sure that Nxf2 is good for black but it is possible that black has abother move that leads to big advantage so I may have the same mistake of assuming that there is only one good move when there is practically more than one good move. Uri
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.