Author: Larry Griffiths
Date: 13:51:12 08/29/00
Go up one level in this thread
On August 29, 2000 at 16:13:31, Severi Salminen wrote: >Hi! > >>I plan on implementing it to see what happens. This heuristic is related to >>killer moves and uses the from and to squares in a 64 x 64 array to maintain >>history information when moves are bestmoves or cutoffs. Each entry has 2 to >>the depth power added to it when a bestmove or cutoff is found. > > >Why do you add a value depending on depth (2^depth)? Why not just increment by >1? Just asking because I'm new to chess programming techniques and I'm starting >to program my own creature... > >Severi I believe the idea was to give higher weights to nodes near the root since they are not updated as often. Larry.
This page took 0.01 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.