TalkChess.com

cloning is the new learning :D still waiting for some 100 elo/month geniuses to pass SF but somehow that never happens... It used to be possible in the old days (pre ~2015) to clone + add a few new tricks and become #1 for a while. But IMO, the biggest contribution of SF is not the engine itself, b...

If the draws do not matter in understanding who is stronger, why does the Elo calculation get a totally wrong answer if you set the draws to zero? I do understand we are looking for a razor turning point and not a magnitude. But I think it should be more obvious which is stronger if we know an engi...

If the draws do not matter in understanding who is stronger, why does the Elo calculation get a totally wrong answer if you set the draws to zero? I do understand we are looking for a razor turning point and not a magnitude. But I think it should be more obvious which is stronger if we know an engi...

Thanks, this looks very useful as a standard for other programs to conform to. With such a standard in place, I wonder how hard it would be to write a "perft_bisect engine1 engine2" tool that will take the divide output of two perft binaries and zooms in on the first discrepancy or returns silently ...

If you require GPU support on Ubuntu, please also install Bazel (from https://github.com/FloopCZ/tensorflow_cc) Thanks for correcting me! But at least it's a one time use and you don't need to integrate Bazel into your own project build. I've also just found another package that is installable on D...

LeelaChessZero uses the 3rd party tensorflow_cc wrapper library around the official Tensorflow C++ API, to avoid the Bazel build stuff. See https://github.com/LeelaChessZero/lc0/blob/master/tensorflow.md Thanks for the link. Bazel is still necessary to build the library itself. This is in fact what...

I developed my own home-made C++ deep-learning framework just to be able to do that. I used tensorflow for a while, but it was too painful to use from C++. What you describe can be done with tensorflow, but last time I tried, I had to use undocumented/unsupported features of the low-level C++ tenso...

Thanks, looking forward to it. You have a knack for raising such intricate points.

@hgm, you post a lengthy analysis, two people respond, and then you drop the subject? Nothing of interest to comment on?

In Stratego, there is a similar problem with such interposing attacks that lead to nowhere. There is the rule that you can't do more than 3 consecutive moves with the same piece between 2 squares. To implement this, the position struct keeps track of a small circular buffer of the last 3 squares per...