Raid
-
- Posts: 632
- Joined: Thu Jun 10, 2010 12:50 am
Re: Raid
What is the purpose of this engine? In fact, the attached source code I found at Chess Engines Diary is fake! There is an old Glaurung code from 2009 attached, and has nothing to do with the current engine. I find such engines disgusting! If you don't want to publish source code, it's better not to publish it at all than to fool people with Fake!
Peace be with you!
Re: Raid
Thanks for the warning, Eduard.Eduard Nemeth wrote: ↑Sat May 13, 2023 5:41 pmWhat is the purpose of this engine? In fact, the attached source code I found at Chess Engines Diary is fake! There is an old Glaurung code from 2009 attached, and has nothing to do with the current engine. I find such engines disgusting! If you don't want to publish source code, it's better not to publish it at all than to fool people with Fake!
Best wishes.
Re: Raid
Considering that there's already many derivatives which just add polyglot support, that only makes the "Raid" derivative even more useless (if it even exists)Eduard Nemeth wrote: ↑Sat May 13, 2023 5:41 pmWhat is the purpose of this engine? In fact, the attached source code I found at Chess Engines Diary is fake! There is an old Glaurung code from 2009 attached, and has nothing to do with the current engine. I find such engines disgusting! If you don't want to publish source code, it's better not to publish it at all than to fool people with Fake!
-
- Posts: 632
- Joined: Thu Jun 10, 2010 12:50 am
Re: Raid
There are people who say: I don't want to publish the source code. Good! Then such engines should remain private, no problem. But worse is releasing wrong code, which says so much that the author thinks people are stupid.
Peace be with you!
Re: Raid
Raid v2.1 Engage
fast strong engine, thanks to the SF Team , Dorsz & sir Morales.
Hope you enjoy it. peace
https://pixeldrain.com/u/J89xC4Tp
fast strong engine, thanks to the SF Team , Dorsz & sir Morales.
Hope you enjoy it. peace
https://pixeldrain.com/u/J89xC4Tp
-
- Posts: 632
- Joined: Thu Jun 10, 2010 12:50 am
Re: Raid
1% change to Swordfish? No. Here is nothing (99.99999%) Swordfish. I only see following changes of some parameters to Stockfish 010723 in search, can someone find more changes?
(Implemented is the Polyglot book, but that's not a specific feature of Swordfish. I'm happy I've stopped making my new engines available for download, even though they have more changes to Stockfish than this cheap clone here. I believe the following line is from Swordfish:
return std::min((8 * d + 240) * d - 276 , 1907); That is all
Difference to Stockfish 010723 is only this, only a few parameter values (therefore I will not test this and such engines):
Stockfish 010723:
// Futility margin
Value futility_margin(Depth d, bool improving) {
return Value(140 * (d - improving));
}
// Reductions lookup table, initialized at startup
int Reductions[MAX_MOVES]; // [depth or moveNumber]
Depth reduction(bool i, Depth d, int mn, Value delta, Value rootDelta) {
int r = Reductions[d] * Reductions[mn];
return (r + 1372 - int(delta) * 1073 / int(rootDelta)) / 1024 + (!i && r > 936);
}
constexpr int futility_move_count(bool improving, Depth depth) {
return improving ? (3 + depth * depth)
: (3 + depth * depth) / 2;
}
// History and stats update bonus, based on depth
int stat_bonus(Depth d) {
return std::min(336 * d - 547, 1561);
}
New engine Raid v2.1:
// Futility margin
Value futility_margin(Depth d, bool improving) {
return Value(163 * (d - improving));
}
// Reductions lookup table, initialized at startup
int Reductions[MAX_MOVES]; // [depth or moveNumber]
Depth reduction(bool i, Depth d, int mn, Value delta, Value rootDelta) {
int r = Reductions[d] * Reductions[mn];
return (r + 1433 - int(delta) * 1021 / int(rootDelta)) / 1024 + (!i && r > 936);
}
constexpr int futility_move_count(bool improving, Depth depth) {
return improving ? (3 + depth * depth)
: (3 + depth * depth) / 2;
}
// History and stats update bonus, based on depth
int stat_bonus(Depth d) {
return std::min((8 * d + 240) * d - 276 , 1907);
}
(Implemented is the Polyglot book, but that's not a specific feature of Swordfish. I'm happy I've stopped making my new engines available for download, even though they have more changes to Stockfish than this cheap clone here. I believe the following line is from Swordfish:
return std::min((8 * d + 240) * d - 276 , 1907); That is all
Difference to Stockfish 010723 is only this, only a few parameter values (therefore I will not test this and such engines):
Stockfish 010723:
// Futility margin
Value futility_margin(Depth d, bool improving) {
return Value(140 * (d - improving));
}
// Reductions lookup table, initialized at startup
int Reductions[MAX_MOVES]; // [depth or moveNumber]
Depth reduction(bool i, Depth d, int mn, Value delta, Value rootDelta) {
int r = Reductions[d] * Reductions[mn];
return (r + 1372 - int(delta) * 1073 / int(rootDelta)) / 1024 + (!i && r > 936);
}
constexpr int futility_move_count(bool improving, Depth depth) {
return improving ? (3 + depth * depth)
: (3 + depth * depth) / 2;
}
// History and stats update bonus, based on depth
int stat_bonus(Depth d) {
return std::min(336 * d - 547, 1561);
}
New engine Raid v2.1:
// Futility margin
Value futility_margin(Depth d, bool improving) {
return Value(163 * (d - improving));
}
// Reductions lookup table, initialized at startup
int Reductions[MAX_MOVES]; // [depth or moveNumber]
Depth reduction(bool i, Depth d, int mn, Value delta, Value rootDelta) {
int r = Reductions[d] * Reductions[mn];
return (r + 1433 - int(delta) * 1021 / int(rootDelta)) / 1024 + (!i && r > 936);
}
constexpr int futility_move_count(bool improving, Depth depth) {
return improving ? (3 + depth * depth)
: (3 + depth * depth) / 2;
}
// History and stats update bonus, based on depth
int stat_bonus(Depth d) {
return std::min((8 * d + 240) * d - 276 , 1907);
}
Peace be with you!
Re: Raid
Hi orgz
Thanks for sharing your work with us. It’s not important that it’s the best engine or not the important thing is , you tried for us. Many thanks. I hope you can even make better and better engines in future.
Best regards
Thanks for sharing your work with us. It’s not important that it’s the best engine or not the important thing is , you tried for us. Many thanks. I hope you can even make better and better engines in future.
Best regards