Author: Robert Hyatt
Date: 19:21:40 08/28/00
Go up one level in this thread
On August 28, 2000 at 19:32:05, Larry Griffiths wrote: >I have been reading about the History Heuristic and have seen pro's and con's >about it. > >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. > >Would you recommend the History Heuristic, and has anything changed for the >better with the method described above? > >Thanks in advance. > >Larry. Works fine, but don't use 2^depth... for reasonable search depths, that will overflow 32 bit counters almost immediately. I use depth^2 which is much safer... Other than that it works fine. If you don't get a cutoff by the time you have tried a few history-ordered moves, you probably should give up and just search the rest of the moves in random order.
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.