TalkChess.com

The Chess Programming Wiki has an excellent description:
https://www.chessprogramming.org/Stockf ... _Structure

8-bit accuracy is often accurate enough, and faster than floating point. The tensor cores of the most recent NVIDIA GPUs can do 4-bit calculation (in addition to 8-bit interger, and 16-bit float). The next generation will also allow sparsity, which is another big potential for performance improvemen...

You can use the logit of the probability of winning, and multiply it by a constant so that it looks like centipawns. I do this for my program, and it works very well. I use this, which is the same thing right? https://www.chessprogramming.org/Pawn_Advantage,_Win_Percentage,_and_Elo It's convenient ...

Especially because engines like LC0 score only in terms of probability - without WDL support, there is no meaningful eval display possible. Printing the score in centipawns and expecting the user to know this is meant as win score expectation is a bad hack anyway. The other way around fails also be...

I took a quick look at the content, and it seems there is extremely little machine learning in this book, except for a decision tree in Chapter 2. Mostly genetic algorithms and population-based methods. No neural network. But what they describe may be fun programming experiments.

Zeta v097 and v098 were an attempt to make use of thousands of parallel gpu- threads via an parallel Best-First-MiniMax search and classic evaluation. Very interesting, thanks. When using large neural networks, evaluation is so slow that data transfers between CPU and GPU have very little cost. To ...

I tried to reuse the current tree for the next move, but in Zeta v097/v098 I had to copy the tree back n forth between cpu/gpu, and the memory got quickly filled, so I kept it as disabled option. But in theory it should give you an boost. You store the tree in the GPU? I am very surprised. My intui...

Hi, I have also been generating an opening book automatically. My approach is simply to use MCTS to grow the book, using a long search to evaluate the leaves, and negamax backup. It is a bit similar to the drop-out expansion approach of the Othello book algorithms, but I like the MCTS approach bette...

Another generic game framework.

https://arxiv.org/abs/1908.09453
https://github.com/deepmind/open_spiel

This may be of interest to the chess variant people:
https://arxiv.org/abs/1905.05013
http://ludii.games/