Computer Chess Club Archives

Search

Messages

Subject: Re: What is the most difficult MATE to find for a computer program ???

Author: Gian-Carlo Pascutto

Date: 11:33:30 12/27/00

Go up one level in this thread

On December 27, 2000 at 13:55:09, Ricardo Gibert wrote:

>Extending when there are few legal responses is sufficient.

True, but I suspected Vincent does more than just that.

>The apparent depth is something of an illusion since the
>defenders replies are forced. This should be easy for CNS.

Sjeng's matefinder uses an approach which is very similar to
CNS, but even faster in this kind of positions, so, yes, it
would be easy for CNS too.

--
GCP

• Re: What is the most difficult MATE to find for a computer program ??? David Rasmussen 12:13:30 12/27/00
  • Re: What is the most difficult MATE to find for a computer program ??? Gian-Carlo Pascutto 12:51:53 12/27/00
    • Re: What is the most difficult MATE to find for a computer program ??? Vincent Diepeveen 14:40:33 12/27/00

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.