As I said

Moderator: Ras
As I said
Note that micro-Max doesn't have to use a special treatment of mate scores in the hash table. so that this is also not in the code I posted above. The reason is that micro-Max' search itself already works with correct mate scores, through the delayed-loss bonus. The latter ameliorates negative search scores for the side to move (including mated-in-N scores, which are very negative) by one score quantum. This provides an incentive to take the shortest path to a given gain.
Code: Select all
// when entering Search():
alpha -= (alpha < currentEval);
beta -= (beta <= currentEval);
// when leaving Search():
return bestScore + (bestScore < currentEval);
Are you still running the binary I last sent you?
Yes I use the latest submitted binaries. I just didn't bother renaming them in the cute chess config. Will do so in season 2 to avoid confusion.mvanthoor wrote: ↑Thu Jun 17, 2021 3:53 pmAre you still running the binary I last sent you?
That one is 2.2.100, which is a dev-version, a bit stronger than Alpha 2; somewhere between 1860 and 1890 in my testing. Thomas also sent you a development version of MMC, which is also stronger than the current CCRL listing.
It doesn't really matter in the end. I'm already glad that the engine can finish tournaments without problems. Playing strength will come with time. I hope to wrap up the Alpha 3 release tomorrow evening. (Which basically is a renamed 2.2.100.)