Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: a test position for computer programs(perpetual check)

Author: Christophe Theron

Date: 01:07:55 05/31/98

Go up one level in this thread


On May 30, 1998 at 09:32:49, blass uri wrote:

>the position:q5k1/4Q3/5r2/5P1B/6PK/8/8/8 white to move
>
>Qxf6 leads to perpetual check begin with Qh1+
>with 99968 Kbytes hash tables fritz5 found the draw after 32
>seconds computing 9823 Knodes

On which processor?


>Junior4.6 found the draw after 10 minutes and 21 seconds
>and it computed 92,632 Knodes.

On which processor?


>we see that the computers do not know what lines to compute
>because I can see the draw by looking at less than 1000 nodes.
>
>fritz5 is only very weak in this position while other programs I have
>are weaker than fritz5.
>
>is there a program that can see the draw
>after less nodes than fritz5?
>
>Uri

Tiger finds the draw in 434s (7min 14s) on my K5-100MHz with 16Mb hash.


You say that computers don't know which line to compute.

OK. So load this position and try to find the key yourself:

6k1/5p2/3P2p1/7n/3QPP2/7q/r2N3P/6RK b - -

Tiger finds the key in 3 seconds on my K5-100 (with the right score,
showing that he knows that it is a draw).

I guess a lot of programs find this one very quickly too.


    Christophe



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.