Computer Chess Club Archives


Search

Terms

Messages

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

Author: blass uri

Date: 03:46:00 05/31/98

Go up one level in this thread



On May 31, 1998 at 04:07:55, Christophe Theron wrote:


>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
fritz5 find the draw after 49 seconds if I use 37,952 kbytes
after looking at 13074 Knodes
it seem to be optimal
if I use 38,976 Kbytes or 40000 Kbytes or more it
is slower and need more nodes(there is not a big difference)

this is strange because the hash tables are not full in all the cases
 that I tested when fritz5 find the draw.

maybe this is a problem of windows95.
does someone know if under windows98 fritz5 behave differently?

Junior4.6 is faster than fritz5
It finds the draw after 52 seconds after looking at 6543 Knodes
if I use 37,952 Kbytes hash tables
and because the real Junior is 20% faster I say it is faster in time
than fritz5.

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.