Author: milix
Date: 10:36:50 03/11/04
Go up one level in this thread
I had similar problems and I solved them by: 1. Do not return a score (and a best move) from hash tables if you are searching the root. You need a formula like 'if search_ply <= 1 then do not return the score from the hash table, just use the bestmove and continue searching'. 2. I also do not store root positions. 3. You need to handle mate scores properly. I use the 'distance to mate' concept and I always store a mate score as MATE-MAX_MATE_DEPTH in the hash table and when I need the score back I return MATE - search_ply.
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.