Author: Robert Hyatt
Date: 13:48:23 04/11/00
Go up one level in this thread
On April 11, 2000 at 15:08:39, John Coffey wrote: >On April 10, 2000 at 20:23:40, Robert Hyatt wrote: > >>On April 10, 2000 at 14:45:13, John Coffey wrote: >> >>>Let me get this sraight.... >>> >>>1. hash is the transposition table. >>>2. hashp is pawn structure caching? >>>3. cache is used for tablebase caching? >>> >>>How does one cache tablebase stuff? It is all endgames so I am not sure I see >>>the benefit. I guess that the exact same endgame could arrise in multiple >>>continuations. >>> >>>John Coffey >> >> >>That's the answer. Same ending, slightly different piece locations... with both >>TB values in the same "block". Saves a lot of I/O. And then the results are >>also stashed in the hash table to further save time... > > > >So when hitting the disk for tablebase information, what is the ideal amount of >data to read at one time. Does Windows read things in 4k blocks or larger? Do >you cache things yourself or do you let the OS do it for you? > >John Coffey I tested this like crazy for Eugene. I don't remember the number, but think it might have been 8K (it is the parameter you have to pass to the compression program). 8K was right for the three different machines I tested it on...
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.