Chess Forum

Solista wrote: ↑Wed Mar 27, 2024 10:53 pm Keep the book! I would give it to you for free too.

---------------------------------------------------------------

This line is funny, which was changed by the developers to VVLTC search tune:

SF dev "VVLTC search tune" changed:

Depth Search::Worker::reduction(bool i, Depth d, int mn, int delta) {
int reductionScale = reductions[d] * reductions[mn];
- return (reductionScale + 1091 - delta * 759 / rootDelta) / 1024 + (!i && reductionScale > 950);
+ return (reductionScale + 1107 - delta * 725 / rootDelta) / 1024 + (!i && reductionScale > 956);


And what does it say in HypnoS 240324 VVLTC search tune? So:

Depth reduction(bool i, Depth d, int mn, int delta, int rootDelta) {
int reductionScale = Reductions[d] * Reductions[mn];
return (reductionScale + 1346 - int(delta) * 896 / int(rootDelta)) / 1024
+ (!i && reductionScale > 880);

Absolute wrong (very old SF code, no VVLTC search tune).

Solista wrote: ↑Wed Mar 27, 2024 10:08 pm Like I said, it's a mix of old and new in the Hypnos 190324 version. Just two quick comparisons, the hypnos code here is 2 months older than the SF dev code.

SF dev:

for (size_t i = 1; i < reductions.size(); ++i)
reductions = int((19.80 + std::log(size_t(options["Threads"])) / 2) * std::log(i));

Hypnos dev

for (int i = 1; i < MAX_MOVES; ++i)
Reductions = int((20.37 + std::log(Threads.size()) / 2) * std::log(i));

---

SF dev.

Depth Search::Worker::reduction(bool i, Depth d, int mn, int delta) {
int reductionScale = reductions[d] * reductions[mn];
return (reductionScale + 1091 - delta * 759 / rootDelta) / 1024 + (!i && reductionScale > 950);

Hypnos dev.

Depth reduction(bool i, Depth d, int mn, int delta, int rootDelta) {
int reductionScale = Reductions[d] * Reductions[mn];
return (reductionScale + 1346 - int(delta) * 896 / int(rootDelta)) / 1024
+ (!i && reductionScale > 880);

----------------------------------------------------------------------------------------------------------------------------------

My Solista Attack book is commercial, I sell it, it's not free. I have two versions, BIN and CTG. Which one do you use? The current version is 8.4.

Gannicus wrote: ↑Mon Apr 01, 2024 12:05 am Your statements are incorrect, you lack the expertise to back them up
Otherwise the programmers in the stockfish community wouldn't waste time testing my code
https://tests.stockfishchess.org/tests
The HypnoS code is simply structured based on my needs for compatibility with the various vb.NET tools that I want to continue using
- so refactoring is missing
- all patches related to it are missing
- Patches intentionally omitted due to incompatibility are missing with the tools I use
so stop talking nonsense.

Solista wrote: ↑Wed Mar 27, 2024 10:08 pm Like I said, it's a mix of old and new in the Hypnos 190324 version. Just two quick comparisons, the hypnos code here is 2 months older than the SF dev code.

SF dev:

for (size_t i = 1; i < reductions.size(); ++i)
reductions = int((19.80 + std::log(size_t(options["Threads"])) / 2) * std::log(i));

Hypnos dev

for (int i = 1; i < MAX_MOVES; ++i)
Reductions = int((20.37 + std::log(Threads.size()) / 2) * std::log(i));

---

SF dev.

Depth Search::Worker::reduction(bool i, Depth d, int mn, int delta) {
int reductionScale = reductions[d] * reductions[mn];
return (reductionScale + 1091 - delta * 759 / rootDelta) / 1024 + (!i && reductionScale > 950);

Hypnos dev.

Depth reduction(bool i, Depth d, int mn, int delta, int rootDelta) {
int reductionScale = Reductions[d] * Reductions[mn];
return (reductionScale + 1346 - int(delta) * 896 / int(rootDelta)) / 1024
+ (!i && reductionScale > 880);

----------------------------------------------------------------------------------------------------------------------------------

My Solista Attack book is commercial, I sell it, it's not free. I have two versions, BIN and CTG. Which one do you use? The current version is 8.4.