Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: The Most Difficult Tactical Combination Ever Shocking Computer Analysis

Author: Gian-Carlo Pascutto

Date: 08:29:47 12/02/01

Go up one level in this thread


On December 01, 2001 at 15:36:39, Roy Eassa wrote:

>Ali created the problem, saying that it would not be considered solved until a
>program could demonstrate that it saw the "whole" line up front.  Thus, HIS
>puzzle was not solved.  A different puzzle, that you derived from his puzzle,
>apparently was.  (Gandalf was the only one to solve Ali's puzzle, at least that
>I've seen so far.)

He attached a relation to it which is somehow supposed to say
something about the performance of chessplaying programs.

I say this is complete, pure and utter nonsense.

As far as I am concerned, my program can play Nxg6 and display a PV
wherein it sacs its queen and all minor pieces to be mated itself on
the last move.

I don't care as long as it plays Nxg6.

--
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.