Computer Chess Club Archives


Search

Terms

Messages

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

Author: Vincent Diepeveen

Date: 14:40:33 12/27/00

Go up one level in this thread


On December 27, 2000 at 15:51:53, Gian-Carlo Pascutto wrote:

>On December 27, 2000 at 15:13:30, David Rasmussen wrote:
>
>>I extend on checks and recaptures, but not on few replies. And I have recently
>>disabled mate threat extensions as well. Maybe thats why.
>
>Extending on few replies is the most important on this position.
>
>Sjeng only extends on check and doesn't see the mate in 14 ply,
>but it sees that Ng4 is the best move because it guarantees at
>least a perpetual at ply 2. At ply 9 it sees that it's winning,
>with a 26-ply PV.
>
>I wouldn't worry too much about this kind of position...
>
>--
>GCP

Worry however if your program finds any of the gs2930 positions without
seeing the entire line needed which on average is like 14 to 20 ply
at least... ...so if you find those at depth=1 or whatever your program
is simply blundering away pawns!




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.