Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Q: Nalimov EGTB?

Author: Eugene Nalimov

Date: 10:49:17 08/06/99

Go up one level in this thread


On August 06, 1999 at 11:03:06, KarinsDad wrote:

>On August 06, 1999 at 05:25:52, Inmann Werner wrote:
>
>>On August 05, 1999 at 17:15:42, KarinsDad wrote:
>>
>>
>>>
>>>I will eventually look at what you have and then write my own tablebase code
>>>(just like I write my own code for everything else, APIs being the exception).
>>>But I am currently far from TBs and even opening books.
>>>
>>>Thanks,
>>>
>>>KarinsDad :)
>>>
>>
>>Wish you the best for writing your own TB Code. :)
>>
>>The original probing code has 4408 lines.
>>Bob Hyatts egtb.cpp + probe.c works fine.(Only about 300 lines to rewrite)
>>With the original tbindex.cpp, I had no luck (Excuse Eugene, maybe I am dumb)
>>
>>Werner
>
>Yeah, I see it as 1+ years down the road. I would like to add in win preserving
>moves and I want to see if I can improve upon Eugene's compression algorithm
>(which will be a tough thing to do since Eugene is one smart dude).
>
>This is a "really on the back burner" type of thing since I can download the TBs
>today and use them. But, I always like to say that the code is mine, so I will
>probably attempt it someday.
>
>KarinsDad :)

Good luck. Compression code was written by a person who spent ~10 years on data
compression, and wrote several different compressors for Russian space/military
customers.

Eugene



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.