TalkChess.com

This thread is full of eristic intent and sophistry from the author. I vote we shut the thread down as non-productive.

To me this seems more of an attack directed at CCRL team than actually getting to the point. From what I read, the issue is the advertised 40/4 | 40/40 which are actually scaled to some CPU that was decided when the website was started. They clearly state, right at the start, approximates for moder...

To me this seems more of an attack directed at CCRL team than actually getting to the point. From what I read, the issue is the advertised 40/4 | 40/40 which are actually scaled to some CPU that was decided when the website was started. They clearly state, right at the start, approximates for moder...

To me this seems more of an attack directed at CCRL team than actually getting to the point. From what I read, the issue is the advertised 40/4 | 40/40 which are actually scaled to some CPU that was decided when the website was started. They clearly state, right at the start, approximates for moder...

To me this seems more of an attack directed at CCRL team than actually getting to the point. From what I read, the issue is the advertised 40/4 | 40/40 which are actually scaled to some CPU that was decided when the website was started. They clearly state, right at the start, approximates for moder...

To me this seems more of an attack directed at CCRL team than actually getting to the point. From what I read, the issue is the advertised 40/4 | 40/40 which are actually scaled to some CPU that was decided when the website was started. They clearly state, right at the start, approximates for modern...

According to https://developer.android.com/ndk/guides/cpp-support#c_runtime_libraries the NDK supports C++17. But in any case, the c++ version of libchess can be relaxed to C++14 pretty easily (and C++11 with a loss of some compile-time correctness). I think mainly there's constexpr things (which ar...

I'm here to shamelessly advertise my engine Teki: https://github.com/Mk-Chan/Teki

It is MIT based (the lc0nn branch is GPL) and is meant to be a simple bitboard engine. Do take a look at the code to see if it suits you and feel free to *spoon* it.

So I see the problem being that in order to tell that the perpetual is still available at any depth down the search tree, you have to actually search for the perpetual again. Reason being situations where the other side can introduce a potential (or actual) check blocker (for example if white had a ...

I think this is the first project I have looked over that used Open MP to do the SMP for a chess search study: https://github.com/hennimohammed/parallel_chess_engine I had done it myself for perft but it didn't seem to scale as well as making a thread pool myself and doing it. I had figured there w...