Author: Komputer Korner
Date: 21:03:15 11/24/97
Go up one level in this thread
Okay can we agree that once the hash table fills up, the search slows down by a factor of around 2. Surely this isn't worse than not having hash tables to begin with. With full hash tables, if the replacement strategy does only one effective job and that is improve move ordering relative to not having any hash tables, then I can't see how any drunken sailor effects would make the search slower than without hash tables. We have never cleared this difference of opinion up between Bob and Chris. The drunken sailor analogy is not mine but is Chris Whittington's.
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.