Author: Brian Richardson
Date: 14:18:38 03/03/00
Go up one level in this thread
Thanks for the quick replys. So, it is OK that different hash table sizes will result in different moves being selected (I am still somewhat uncomfortable with this somewhat nondeterministic behavior--although it should be deterministic when searching to a given fixed depth and with a given hash size). Is it still the case that bigger is better (so long as paging is not an issue) with hash tables, even if the "best" move is not picked for some test suite problems? Also, can anyone (easily) explain WHY different moves would result--I would think hash tables should not impact the search tree, just speed it up??
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.