Author: Artem Pyatakov
Date: 11:27:39 07/06/01
I was taking a peek at Crafty's source code and came across this comment inside the Search() function: ---------------------------------------------------------- | | | if there is no best move from the hash table, and this | | is a PV node, then we need a good move to search | | first. while killers and history moves are good, they | | are not "good enough". the simplest action is to try | | a shallow search (depth-2) to get a move. note that | | when we call Search() with depth-2, it, too, will | | not have a hash move, and will therefore recursively | | continue this process, hence the name "internal | | iterative deepening." | | | ---------------------------------------------------------- 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.
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.