Computer Chess Club Archives

Search

Messages

Subject: Re: Another Candidate for the Most Difficult Tactical Combo in the World

Author: Uri Blass

Date: 15:10:27 02/08/02

Go up one level in this thread

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

• Re: Another Candidate for the Most Difficult Tactical Combo in the World Uri Blass 15:26:48 02/08/02

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.