Author: Gian-Carlo Pascutto
Date: 15:34:28 07/06/01
Go up one level in this thread
On July 06, 2001 at 14:27:39, Artem Pyatakov wrote: >The comment makes complete sense and "Internal Iterative Deepening" sounds like >a great idea, but could somebody please explain to me how to integrate this >algorithm with the Killer and/or History heuristics? Thanks in advance. I don't really get the question. What is there to integerate? If you have no hash move on a PV node, you do the reduced search and search the resulting move first at full depth. Your killer/history implementation doesn't matter in this. -- GCP
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.