CCRL Discussion Board

I think I can work it out now, thanks!

Well, the index function in the delphi example just gives totally wrong indices. And I was wrong with my KQQK-K example. I forgot I already had a fixed array for all legal king-combinations in a no-pawn situation. 1. WK+BK = 0...563 (all legal king combinations) 2. Q1 = 0...63 3. Q2 = Q1 + 1...63 4....

Returning to my tablebases after a while... I am working out my last size optimization and I don't get the index function. Let's take an example: KQQR-K The array should be built (as far as I understand) this way: 1. K = 0...9 (the unique triangle) 2. Q1 = 0...63 3. Q2 = Q1 + 1...63 4. R = 0...63 5....

A lot of stuff to study I see. Thanks for all reactions. Next subject. What is your compression method? Your point 2) suggests that you try to pack position values in e.g. 5 bits if there are at most 32 different values. Is that your compression? Or do you first pack positions in as few bits as poss...

Hmm I'll have to study on that Mr. Muller :) My unique triangle is working. Now I need some more compression. The methods I use are: 1) Unique triangle, Precalculated legal king-combinations (where the distance between them is larger then 1) 2) Determine the number of bits, needed for a position: If...

Yesssss! I get it!
Thanks very much!

I'll read your post a few times and react when I get it, or not
Thanks.

I started to create my own tablebases a few weeks ago with my own software. Now I would like to know how the unique triangle a1-d1-d4 works. Currently I use my "unique block" a1-d1-d4-a4, which I can understand :) I can't understand the symmetry of the triangle. Is there someone who can ex...