TalkChess.com

There is a conceptional difference between "an exhaustive enumeration of subsequent positions given a certain position" and "an exhaustive enumeration of every possible positions given a certain set of material". The former is essentially a search without any pruning, functionally being a special ca...

Even on the other side, people are using more and more comprehensive testing procedures What do you mean by "on the other side"? It means where a significant portion of the engine is not written in comprehensible code where one can accept or reject certain part of its changes. This is on the opposi...

There are established testing frameworks and with the effort of some communications there are "free" compute resources available to conduct reasonably conclusive tests in a timely manner. Even on the other side, people are using more and more comprehensive testing procedures, so chess-related develo...

Maybe people just don't need one.

https://arxiv.org/abs/1903.03129

Flipping colors of the board is not exactly the same as "reaching certain position with which side to move", they are different concepts. Positive scores and negative scores have different weighted averaging windows, it may be similar to what some engines did. Internally, CDB counts the shortest lin...

The back propagation of scores consider many factors: it does not prefer draws, a small penalty is given for non-progression, the number of counter-moves and their score contribution to the final weighted average score. White and black are not strictly treated equally to prevent those effects to cas...

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...