Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: How to test hashtable implementation?

Author: Tony Werten

Date: 22:14:08 07/23/01

Go up one level in this thread


On July 23, 2001 at 16:11:12, Martin Giepmans wrote:

>Thanks for your information. My program sticks with Kb1 once it has found
>it and the score doesn't go up & down. The only odd thing is that it races
>to depth 30 and then suddenly ... stops racing. No real problem, I guess, the
>hashtable is probably too small.

Seems quite normal if the searchscore has been equal all the time. Before you
got a lot of cutoffs. Now you're about to fail high and a lot of extra nodes are
going to be searched. Unfortunately you don't have much information about these
"new" moves (in killer or history ) and your search explodes.

cheers,

Tony



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.