Search found 338 matches

by noobpwnftw
Tue Mar 13, 2018 5:25 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: 7-men Syzygy attempt
Replies: 588
Views: 128636

Re: 7-men Syzygy attempt

I will add my 16-bit permutation and compression code to github, but I will probably not have time before the weekend. Thank you, and I think it is possible to differentiate between file formats with the fifth byte in the header or just use another magic value. With your new 16-bit compression code...
by noobpwnftw
Tue Mar 13, 2018 3:42 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: 7-men Syzygy attempt
Replies: 588
Views: 128636

Re: 7-men Syzygy attempt

I did change the stat limits according to their pawn version like so.

Now MAX_PLY=768 should be sufficient for 7-men TBs, I will verify the generation process works without problem before moving on to the compression part.
by noobpwnftw
Sun Mar 11, 2018 5:18 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: 7-men Syzygy attempt
Replies: 588
Views: 128636

Re: 7-men Syzygy attempt

About the "find_val:not found" problem happened at the third reduction, I think this line may need to be changed into

Code: Select all

j = CAPT_CWIN_RED + 1 + i - REDUCE_PLY_RED;
I'm still not quite sure about this.
by noobpwnftw
Sun Mar 11, 2018 3:43 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: 7-men Syzygy attempt
Replies: 588
Views: 128636

Re: 7-men Syzygy attempt

int overflow happened with the factor[] array, now it seems to be working!
by noobpwnftw
Sun Mar 11, 2018 1:07 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: 7-men Syzygy attempt
Replies: 588
Views: 128636

Re: 7-men Syzygy attempt

The encoding/decoding scheme in principle can deal with that, but there may be a 32-bit overflow in an intermediate calculation. Thank you for this information, then I will look into it and see if I can fix the index calculation overflow first. They all have the same size/index range. Indeed, they ...
by noobpwnftw
Sun Mar 11, 2018 6:17 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: 7-men Syzygy attempt
Replies: 588
Views: 128636

Re: 7-men Syzygy attempt

Found the thread:
http://www.talkchess.com/forum/viewtopic.php?t=59947

And the crash above seems to be the tb_size calculation from permute type 0 is not the largest possible in trylist.
by noobpwnftw
Sat Mar 10, 2018 11:11 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: 7-men Syzygy attempt
Replies: 588
Views: 128636

Re: 7-men Syzygy attempt

Also I tried building KRBNvKQN which has the longest mate among pawnless 7-men TBs, the step counter should overflow: Iteration 241 ... done. ...omitted... Iteration 299 ... done. Iteration 300 ... find_val: not found! There is REDUCE_PLY which I believe halves the counter past it, but I strongly su...
by noobpwnftw
Sat Mar 10, 2018 4:14 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: 7-men Syzygy attempt
Replies: 588
Views: 128636

7-men Syzygy attempt

So with some fiddling and help from https://github.com/jjoshua2/tb/ It seems at least some of the 7-men TBs can be produced. Here is the current code: https://github.com/noobpwnftw/tb/tree/7-men, and here are all 3-6 men + some 7 men TBs I've generated so far: ftp://112.73.74.24/pub/syzygy/ However,...
by noobpwnftw
Sat Feb 24, 2018 3:55 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Some opening book design questions
Replies: 39
Views: 10695

Re: Some opening book design questions

Actually, Chess has every necessary parts ready(i.e. results from fishtest) to make a book by brute force. It might practically ultra-weak solve the opening.
by noobpwnftw
Fri Feb 23, 2018 2:23 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Some opening book design questions
Replies: 39
Views: 10695

Re: Some opening book design questions

It would then require 12(RCN) * 7 + 6(P) * 10 + 4(B) * 4 + 3(A) * 4 + 4(K) * 2 + 1(turn) = 181 bits or even less if palace states are combined. Although keys(either hash or other formats) are known before probing the book, unlike EGTBs that you won't store keys at all(accessed with data[index] = val...