TalkChess.com

If this is HTTP code 406 from the server, then you might want to add more "Accept-???" headers as per curl or wget sends in your request.

The link gives the following in response: "content-type: application/x-chess-pgn".
How does your library handle such uncommon MIME type? From the error message, it seems paranoid about it and you may want to find a way to handle it as "text/plain".

Calling API over the Internet for learning at any meaningful scale is not efficient, you should then set up local environment from my data snapshots and make changes to API as you see fit.

I asked if there is a mean to obtain, via code and for a given position, the best move and its associated depth, score and winrate. Providing depth to any move require recursive probing within the database which is quite resource heavy, so it is only performed upon explicit request. The move sugges...

I don't know if it is worth the trouble to reconstruct the entire shortest line(which may not be actually short), if the longer history that gets fed into NN (which is truncated) has virtually no influence in detecting repetitions. To avoid exploring them unnecessarily just expand them when they are...

Damir wrote: ↑

Thu Oct 24, 2019 5:07 pm

Noob is only saying this cause is experimenting with extreme BIOS settings and expect them to work…

Exactly the opposite, I have no interest in trying anything other than defaults, and that is precisely my complaint is about.

s this database snapshot the same as the one accessible from https://www.chessdb.cn/queryc_en/ ? Something I noticed was that it had reached and surpassed 9000000K positions, but every time it'd go up eventually it'd go back to sub 9000000K. But recently it has gone down to 5000000K as if almost ha...

Well, here is the thing: There is no magic here, I cut corners by essentially refuting the lines with shorter depth searches, it still takes a substantial amount of computations to back this up by resolving those shorter lines including multi PV to their exact scores. On the other hand, I gave you t...

By the way, in your example, I think there also exists many equivalently short lines to get to that position without involving double blunders, so it may not be the case that the only chance of expanding the node is by one particular bad sequence of moves that never worth exploring.

we discard 1.Rc7 and never look at it again It still shouldn't stop you from expanding it under all circumstances. As the tree grows you will eventually expand one of these. Now this is a tricky problem of whether you want to force expanding the node when it is your main line, if you do that, then ...