mirror of
https://github.com/sockspls/badfish
synced 2025-04-29 16:23:09 +00:00
Revert "Check for easy move just once"
This reverts commit a24da071f0
Seems a regression when tested against 2.3.1
With this patch, have after 20000 games at 60+0.05, we have
ELO: 13.42 +-4.8 (95%) LOS: 100.0%
Total: 20000 W: 3746 L: 2974 D: 13280
Instead with the patch reverted:
ELO: 16.62 +-4.8 (95%) LOS: 100.0%
Total: 20000 W: 3816 L: 2860 D: 13324
Although we are within error bounds here we take the conservative
approach of not introducing changes that are not proved stronger
It doesn't mean that the change shall be weaker, simply that we
don't want to take any risk.
No functional change.
This commit is contained in:
parent
70d20326b0
commit
d2eeef89aa
1 changed files with 0 additions and 3 deletions
|
@ -293,7 +293,6 @@ namespace {
|
|||
Stack ss[MAX_PLY_PLUS_2];
|
||||
int depth, prevBestMoveChanges;
|
||||
Value bestValue, alpha, beta, delta;
|
||||
bool triedEasyMove = false;
|
||||
|
||||
memset(ss, 0, 4 * sizeof(Stack));
|
||||
depth = BestMoveChanges = 0;
|
||||
|
@ -440,12 +439,10 @@ namespace {
|
|||
// Stop search early if one move seems to be much better than others
|
||||
if ( depth >= 12
|
||||
&& !stop
|
||||
&& !triedEasyMove
|
||||
&& PVSize == 1
|
||||
&& ( RootMoves.size() == 1
|
||||
|| Time::now() - SearchTime > (TimeMgr.available_time() * 20) / 100))
|
||||
{
|
||||
triedEasyMove = true;
|
||||
Value rBeta = bestValue - 2 * PawnValueMg;
|
||||
(ss+1)->excludedMove = RootMoves[0].pv[0];
|
||||
(ss+1)->skipNullMove = true;
|
||||
|
|
Loading…
Add table
Reference in a new issue