Author: Peter Kappler
Date: 22:00:01 08/28/00
Go up one level in this thread
On August 28, 2000 at 22:42:38, Larry Griffiths wrote: >On August 28, 2000 at 21:44:24, Christophe Theron wrote: > >>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. >> >> > >> >>For what it's worth, I don't use it. >> >> >> Christophe > >Thanks for the reply Christophe. Seems like I saw where you have a very good >chess program, but I cannot remember what it is. I plan on taking a quick trip >down this rabbit trail anyway. It should be easy to implement and I dont have >the energy to program quiescence, extensions etc. Putting in a transposition >table this weekend wore me out. Heh, I can sympathize. The bad news is that you'll still be debugging it in six months, and probably longer. ;) It's one of the trickiest things you'll have to implement in your program. --Peter
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.