Author: Dave Gomboc
Date: 01:06:26 12/25/02
Go up one level in this thread
>>>That's what I thought but why "try" again - have some parameters changed? >> >>Yes, you're searching one ply deeper this time. :-) >> >>Dave > >So the hash move is just a term for the best-so-far and nothing to do with >duplication of positions? The hash table is used for both cases. a) I saw this position before -- searched to at least the depth I want to search to now -- so I can return the score that is stored in the hash table. b) I saw this position before -- but searched not as deeply as I want to search it now -- so I grab the best move, and search it to the current depth. Dave
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.