Author: Tina Long
Date: 19:18:22 08/10/99
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'd appreciate hearing thoughts on this. Thanks Tina Long
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.