mirror of
https://github.com/HChaZZY/Stockfish.git
synced 2025-12-23 18:46:59 +08:00
Simplify some qsearch conditions
Use the assert which ensures that beta == alpha+1 at PVNodes to simplify a little bit the conditions further down in the code. passed STC: LLR: 2.95 (-2.94,2.94) <-1.75,0.25> Total: 56160 W: 14370 L: 14173 D: 27617 Ptnml(0-2): 210, 6192, 15076, 6395, 207 https://tests.stockfishchess.org/tests/view/64bc769cdc56e1650abb2e26 closes https://tests.stockfishchess.org/tests/view/64bc769cdc56e1650abb2e26 No functional change
This commit is contained in:
committed by
Stéphane Nicolet
parent
4b2979760f
commit
78e3d2ad78
@@ -1496,7 +1496,7 @@ moves_loop: // When in check, search starts here
|
||||
return bestValue;
|
||||
}
|
||||
|
||||
if (PvNode && bestValue > alpha)
|
||||
if (bestValue > alpha)
|
||||
alpha = bestValue;
|
||||
|
||||
futilityBase = bestValue + 200;
|
||||
@@ -1608,7 +1608,7 @@ moves_loop: // When in check, search starts here
|
||||
if (PvNode) // Update pv even in fail-high case
|
||||
update_pv(ss->pv, move, (ss+1)->pv);
|
||||
|
||||
if (PvNode && value < beta) // Update alpha here!
|
||||
if (value < beta) // Update alpha here!
|
||||
alpha = value;
|
||||
else
|
||||
break; // Fail high
|
||||
|
||||
Reference in New Issue
Block a user