Author: Jeff GAZET
Date: 10:02:59 05/11/04
Go up one level in this thread
>>Good morning, >> >>i have some questions about the move to add into the hashtable (see code). >>When doing a null move, i don't know which move to insert ? >>At the end of the search() function, the "bestmove" can be null. So in >>TTableInsert(), if the move is NULL, we should return immediatly ? >Slow down and think about this for a minute. >You want the hash table to provide _exactly_ the same information that the >search from this position provided the _first time_ around.> >There is no "best move" to store. You didn't even play a move. Insert a zero >or whatever you use to say "no best move for this position". Yes, this was a stupid question, and i may post some :-) I was just suprised that i had no move to add and i was wondering if this was right. As i'm tracking a bug. >>And another question: the score added to the hashtable depends on the side to >>move, so we should use 2 transpositions tables ? or returning +-score ? >are you using negamax? If so +=good for side to move _always_ no matter which >side is to move... Yes, i forgot that. The hash "includes" the side to move.
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.