Author: blass uri
Date: 22:38:55 08/10/99
Go up one level in this thread
On August 10, 1999 at 22:18:22, Tina Long wrote: >Hi guys, >I remember Komputer Korner & others discussing this a year or so ago. > >I believe there was some concensus around the result approximating: > >"Once the hash tables are full, the time taken to reach a certain depth of >search is 20% longer than if the hash table wasn't full." I know about Fritz5 that the selective depth is lower when it reach the same brute force depth with small hash tables so reaching a certain depth is not the same with small and with big hash tables. Uri
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.