Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: A test position about perpetual check(Junior-Insomniac)

Author: Uri Blass

Date: 21:27:16 11/04/00

Go up one level in this thread


On November 04, 2000 at 23:46:37, Jon Dart wrote:

>Arasan doesn't see anything close to a draw after 10 minutes.
>score is -4.89 and it prefered Qg4+. It searched a depth of
>15 plies, 135 millon nodes.
>
>Crafty also didn't find it in 10 minutes (on a slightly slower
>machine). It's score was around -3.40 and it also preferred
>Qg4+.
>
>That isn't to say there is no draw, however: there sure are
>a lot of checks.
>
>--Jon

I found that my programs cannot find it in a reasonable time inspite of the fact
that the result is a draw if I give them to play and I was interested to know if
there is a better program.

I know that lgoliath can probably see the draw but it also see draws when there
is no draw and I am interested to know if there is a program that can see the
draw by search.

There are a lot of checks but the number of relevant positions is not more than
some thousands so it is possible to see if there is a perpetual check if you use
the right program.

Uri



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.