Author: Tord Romstad
Date: 05:12:38 12/01/03
Go up one level in this thread
On December 01, 2003 at 07:36:06, Uri Blass wrote:
>Another thing that is still not implemented is internal iterative deepening.
>I understand the idea but I still did not think exactly how to implement it
>and after reading a post that suggested that it did not help much I decided to
>look for other ideas.
I found it to be surprisingly effective in Gothmog, despite my extremely
simple implementation. I just added the following three lines of code,
just before the call to generate_moves() in my main search() function:
if(EngineOptions.iid && h==NULL && value>gamma-100 && depth>=5*PLY) {
search(gamma, depth-PLY);
h = get_hash(Stack[Counter].hashkey); }
EngineOptions.iid is a variable telling whether internal iterative
deepening is enabled, h is a pointer to a hash table entry, value
is the static eval for the position, and gamma is my search bound.
Tord
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.