Search found 339 matches

by noobpwnftw
Sun Jul 28, 2019 2:09 pm
Forum: Computer Chess Club: General Topics
Topic: Database snapshot
Replies: 78
Views: 10766

Re: Database snapshot

analyzed by Stockfish with no less than 22 plies at terminal node Interesting, my private database uses depth 22 as well, looks like we found it to be optimal (depth 21 having considerably less quality, depth 23 being consirerably more slow) independently? I tried to probe from startpos with the fo...
by noobpwnftw
Sun Jul 28, 2019 7:10 am
Forum: Computer Chess Club: General Topics
Topic: Database snapshot
Replies: 78
Views: 10766

Re: Database snapshot

In board unit above, if there are more than 3 empty spaces, the first unit is set to 8 and the next unit is the number of empty spaces minus 4.
And correction: turn is a 8-bit flag, instead of 1.
by noobpwnftw
Sun Jul 28, 2019 3:58 am
Forum: Computer Chess Club: General Topics
Topic: Database snapshot
Replies: 78
Views: 10766

Re: Database snapshot

Binary FEN encoding has the following format: <board unit>...<board unit><turn><special unit>...<special unit> Where each board unit has a 8-bit value of: 0 = 1 empty space 1 = 2 empty spaces 2 = 3 empty spaces 3 = p 4 = n 5 = b 6 = r 7 = q 8 = unused to avoid ambiguity 9 = k a = P b = N c = B d = R...
by noobpwnftw
Sun Jul 28, 2019 2:57 am
Forum: Computer Chess Club: General Topics
Topic: Database snapshot
Replies: 78
Views: 10766

Re: Database snapshot

e2e4 15 (8) 2 ! (20-04) 50.61 This reads: <Notation of the move> <adjusted score>(<real score>) <rank> <rank mark> (<# of known reply moves>-<# of good reply moves>) <winrate> For rank, 2 > 1 > 0 where rank=2 means it is a preferred move, rank=1 means it is a good alternative, rank=0 means it's a b...
by noobpwnftw
Sat Jul 27, 2019 9:54 pm
Forum: Computer Chess Club: General Topics
Topic: Database snapshot
Replies: 78
Views: 10766

Database snapshot

For those who want to probe my database locally or for other unspecified reasons, here is a full database snapshot of my book project as of today: ftp://ftp.chessdb.cn/pub/chessdb/data-snapshot-20190728.tar The database contains about 3 billion unique chess positions, mostly connected to startpos, a...
by noobpwnftw
Sat Jul 27, 2019 12:31 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Selfplay training server
Replies: 7
Views: 1747

Re: Selfplay training server

So 1, how do you trust your contributors in their work, what's stopping them from submitting random junk instead? 2, do you have a plan to take in labeled data?
by noobpwnftw
Sun Jun 30, 2019 7:21 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Neural Net Endgame technique
Replies: 7
Views: 2481

Re: Neural Net Endgame technique

There is nothing wrong with evaluating a mate in 1 and mate in 10 equally in terms of winning probabilities. Cosmetic "fixes" (as long as averaging and heuristics involved) without the ability to precisely discover the mating sequence is just as lame as it currently is. In other words, if the eval f...
by noobpwnftw
Sun Jun 30, 2019 5:22 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Linux flavors - opinions
Replies: 29
Views: 4863

Re: Linux flavors - opinions

I've always preferred RHEL/CentOS due to the reason that it has a pretty closed package chain compared to the others. You know what to expect, including many problems due to obsolete packages of course, but few times it gives you surprises. My experience with Ubuntu is things often times works on mi...
by noobpwnftw
Tue Jun 11, 2019 9:10 pm
Forum: Computer Chess Club: General Topics
Topic: OKE - Opening Knowledge Engines
Replies: 94
Views: 8442

Re: OKE - Opening Knowledge Engines

The depth value at the root will be approximately 22 + (distance to leaf). Indeed, but there is still a horizon problem, although the chances of getting something wrong diminishes when depth goes higher. The search breadth should be considerably wider than vanilla search from root position due to M...
by noobpwnftw
Tue Jun 11, 2019 9:00 pm
Forum: Computer Chess Club: General Topics
Topic: OKE - Opening Knowledge Engines
Replies: 94
Views: 8442

Re: OKE - Opening Knowledge Engines

The depth value at the root will be approximately 22 + (distance to leaf). Indeed, but there is still a horizon problem, although the chances of getting something wrong diminishes when depth goes higher. The search breadth should be considerably wider than vanilla search from root position due to M...