Author: Andrew Williams
Date: 03:47:36 12/21/02
Go up one level in this thread
On December 21, 2002 at 06:28:15, Joel wrote: >Thanks Andrew. > >I see a definite problem with my implementation. Still a bit confused however. > >My understanding was that I only stored the 'best move' when the score was an >exact one. Though, clearly this is a problem for MTD(f), since you never get an >exact score. > >Does this mean I should be storing a move (if there is one) for scores which are >lower or upper bounds? > >Joel Yes. In any node if you find a move which returns a score which is >= beta, store the move in the hash table for that node. Andrew
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.