Computer Chess Club Archives


Search

Terms

Messages

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

Author: Ricardo Gibert

Date: 10:55:09 12/27/00

Go up one level in this thread


On December 27, 2000 at 13:32:33, Gian-Carlo Pascutto wrote:

>On December 27, 2000 at 13:07:05, David Rasmussen wrote:
>
>>But still. My program which is fairly strong, searches 13-15 plies (I don't
>>remember) in 5 or 10 seconds on my computer, which is far from enough to see
>>that line. How can one see that line with a normal chess program in one second?
>
>Extend heavily on checking moves and moves where there are few replies
>to check. Extend if one side has mating threats.

Extending when there are few legal responses is sufficient. The apparent depth
is something of an illusion since the defenders replies are forced. This should
be easy for CNS.

>
>Note that this won't necessarily make your program stronger.
>
>--
>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.