Author: guy haworth
Date: 02:41:28 12/13/01
Go up one level in this thread
I think the tablebase cache is just used to keep a list of tablebase'd positions previously accessed, together with their values and depths. I have no stats but would not be surprised if positions turned up repeatedly - in which case Eugene Nalimov is taking advantage of this. Memory suggests that Rob Hyatt had something to do with the optimum runtime-format of Eugene's tablebases, discovering (e.g.) that 8KB was the best block-size to optimise runtime access, though not filesize for which the biggest possible blocksize is best. Maybe Rob had something to do with the cache size as well. G
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.