Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: How to test hashtable implementation?

Author: Andrew Williams

Date: 09:04:14 07/20/01

Go up one level in this thread


On July 20, 2001 at 11:39:06, Adam Oellermann wrote:

>
>>Do you mean the Fine #70 endgame position?
>>Here is it:
>>
>[D]8/k7/3p4/p2P1p2/P2P1P2/8/8/K7 w - - 0 1
>>
>>solution starts with 1.Kb1 Kb7 2.Kc1
>>
>>Rafael B. Andrist
>
>Yup, that's the one. Any info on what depth is required to solve it, and how
>long it might take?
>
>Thanks
>Adam

Hi,

Your program should zip down to depth 20-ish in under a second (depending on
hardware). Over the years, mine has found the solution anywhere from depth 23
to depth 27. At the moment, it's finding it at depth 23, after 37390 nodes have
been searched. Mine always takes a longish while to resolve a score, even after
it has found Kb1.

Andrew



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.