Author: Sune Fischer
Date: 03:03:27 07/26/02
Go up one level in this thread
On July 26, 2002 at 04:12:41, Andrzej Nagorko wrote: >On July 25, 2002 at 18:01:49, Robert Hyatt wrote: > ><snip> > >>That is a bit like my old incremental move generation. I would make a move >>and update everything so that generating moves was always trivial. The problem >>is that you make a move, update the stuff, then get a hash hit and don't >>use the updated info at all. I gave up on that and decided to just update >>exactly when it is needed... > > There is easy workaround for this problem. You can calculate hash key of new >position before making move and check hash table before call to make_move. > >Andrzej Yes in the cases where you can return the score it should work (good idea!:), but not if you only get the move, at least not if you have incrementally updated information. -S.
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.