Author: Paul
Date: 07:15:13 01/28/01
Go up one level in this thread
On January 28, 2001 at 09:43:53, Dieter Buerssner wrote: >I believe, that it is possible to do a fast check of the TBs with the >datacomp utility available from Robert Hyatt's ftp. It is included in >the tbexe.zip. I have forgotten the path and the detailed instructions >for the check, but remember, that it was not too difficult. Also, comparing >the file sizes with the sizes in RobertHyatt's TB directory might be useful. This is the quick integrity check: datacomp t filename The filename extension has to be lowercase if I remember correctly, so a dos batch file with a 'for' loop doesn't work unfortunately. >But now to my question: What exactly is checked at the initialzation step >in Eugene Nalimov's code? Is there some sanity check for the correctness >of the found TBs done? If not, wouldn't a program only get problems, when it >first accesses aa corrupt TB? If yes, what is checked for at the initialization >step? I have the source, but nevertheless, the answer to those question is not >obvious to me. I don't know the answers to this one, but I would like to add that it sure takes a long time to start my program when using all 3/4/5 piece tables. Especially when debugging something that has to do with the egtbs, like I'm doing right now, that's pretty annoying. I wish there would be another way to init them, without checks (if that's causing the delay). But of course I'm not really complaining ;) Paul
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.