Author: Colin Frayn
Date: 03:14:06 08/29/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. I use history heuristic in ColChess, but I never found any advantage in using any function of the depth as the incrementing value. In fact I experimented with adding the depth, depth^2, depth*2 etc... and I found that the most successful strategy was to just add 1. I'm not sure if this algorithm actually has a significant benefits. It certainly did when my program was quite simplistic and didn't include many advanced algorithms, but now I'm not so sure. There are also a _lot_ of potential pitfalls, especially overrunning the score bounds and just flooding the table with useless information from one particular branch of the tree which is irrelevant elsewhere. Oh, and this method will probably make your program worse at spotting obscure tactical variations in some cases (depending on how much it improves pruning elsewhere). Let me know if you get it to work well. Cheers, Col
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.