TalkChess.com

That’s what all programmers say, and it is not true. A chess engine should be 100% bug free, no excuses for anything else. What do you call a bug on a chess engine? Is an engine not returning the best move on a given position buggy? Is an engine with hash collisions buggy? Is an engine crashing on ...

jp wrote: ↑

Sat Feb 15, 2020 11:28 am

OCB?

To me, it just means a French brand of papers for cigarette:.
I will return to the CFHA (Club Français des Haïsseur d'Acronymes) a French branch of AHCA (Acronym Haters Club of America).

40/2 testing since the last update report has included (thanks to Gabor and Sergio):
Amoeba 3.1 64-bit 4CPU

Thanks for testing amoeba 3.1.

Many thanks for testing Amoeba 3.1. The progress is within my expectations. Using my own gauntlet test I got +29 (± 15) Elo above version 3.0.

n terms of style of play, restricting the evaluation of a position to the number of moves and no more, results in some disastrous sacrifices. For example a rook with no moves immediately available is considered effectively worthless. I anticipated this but thought that maybe it’s potential might be...

I just release Amoeba 3.1. It fixes a few bugs and probably adds a bunch of others. It should be about 30 Elo stronger than the previous version
https://github.com/abulmo/amoeba/releases/tag/v3.1
Have fun with it.

It sounds like the oracle approach. It was successfull in the 1990s, but was abandonned in favor of tapered evaluation.

PGO can also produce faster binary with gcc.

Damir wrote: ↑

Thu Dec 19, 2019 7:58 pm

I suppose nobody here is dumb enough to use it.....

Dumb, but fast
If you want to see high nodes per second on a single score, you should give it a try.

A pity that there seems to be no, or no reliable package for compiling D in Msys2, which I use now exclusively for compiling C and C++ (with GCC and G++). My previous investigations showed that GDC asked for trouble and isn't recommended and may be even dead since years. GDC is not dead at all. It ...