Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Questions about the new Nalimov tablebase files...

Author: Robert Hyatt

Date: 10:40:37 12/14/02

Go up one level in this thread


On December 13, 2002 at 23:16:25, Mike S. wrote:

>On December 13, 2002 at 15:20:54, Eugene Nalimov wrote:
>
>>On December 13, 2002 at 14:50:30, Dann Corbit wrote:
>>
>>>What is different?
>>>A different compression scheme?
>>>A different encoding scheme?
>>>Why the change?
>>>Has the interface changed?
>>>What changes will be needed from old code to new code?
>>>Have the rules for usage changed?
>>
>>New access code would shortly be released in Crafty 19.2. (...)
>
>Does this mean, there will also be a new tablebase generator tool?
>
>So far, I didn't find the old one on the reorganised FTP. - It was a good
>resource for people who have a slow internet connection (modem dial-up). I
>recommended sometimes to newcomers, to download that and generate the 4-piece
>tbs. on their local machines, so that they didn't have to make long expensive
>download sessions.
>
>It would be a big help to new fans especially, if that (or a new) generator
>executeable would be available again, too.
>
>On this occasion, many thanks for providing all those tablebase data for free,
>to you, to Prof. Bob and to everybody who has contributed.
>
>Regards,
>Mike Scheidl


the problem is that the generator is going to take far more machine than what
you have.

First, if you want to do a P table, you have to have _all_ the promotion cases.
IE get ready
to have a terabyte of space (probably 2-3x this to generate) when you tackle
KPPKPP.  You
have to stop and think a bit to appreciate what you are going to need.  Just the
memory to
handle the generation is non-trivial, not counting the disk space because tables
are not built
in compressed form.



This page took 0.01 seconds to execute

Last modified: Thu, 07 Jul 11 08:48:38 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.