Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: How to test hashtable implementation?

Author: Robert Hyatt

Date: 19:06:33 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.



It is probably a "queen wall".  IE you can search to depth=30, because your
search proves that any pawn promotion can be postponed, which means no queens
are allowed on the board.  But beyond a certain depth, you discover that you
are going to get a queen no matter what... and doing a 30 ply search with a
queen on the board is not going to happen...




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.