mirror of
https://github.com/sockspls/badfish
synced 2025-04-29 16:23:09 +00:00
Simplify improving condition
if we were in check at our previous move we look back until we weren't in check and take the staticEval of that position as reference. Passed STC: https://tests.stockfishchess.org/tests/view/668ba7b65034141ae5996665 LLR: 2.93 (-2.94,2.94) <-1.75,0.25> Total: 74784 W: 19454 L: 19274 D: 36056 Ptnml(0-2): 260, 8874, 18952, 9038, 268 Passted LTC: https://tests.stockfishchess.org/tests/view/668cb2db5034141ae599678b LLR: 2.94 (-2.94,2.94) <-1.75,0.25> Total: 241488 W: 61166 L: 61171 D: 119151 Ptnml(0-2): 190, 27154, 66062, 27147, 191 closes https://github.com/official-stockfish/Stockfish/pull/5492 bench: 1368313
This commit is contained in:
parent
e443b2459e
commit
c755bc1a73
1 changed files with 3 additions and 6 deletions
|
@ -713,7 +713,7 @@ Value Search::Worker::search(
|
|||
if (ss->inCheck)
|
||||
{
|
||||
// Skip early pruning when in check
|
||||
ss->staticEval = eval = VALUE_NONE;
|
||||
ss->staticEval = eval = (ss - 2)->staticEval;
|
||||
improving = false;
|
||||
goto moves_loop;
|
||||
}
|
||||
|
@ -764,12 +764,9 @@ Value Search::Worker::search(
|
|||
|
||||
// Set up the improving flag, which is true if current static evaluation is
|
||||
// bigger than the previous static evaluation at our turn (if we were in
|
||||
// check at our previous move we look at static evaluation at move prior to it
|
||||
// and if we were in check at move prior to it flag is set to true) and is
|
||||
// check at our previous move we go back until we weren't in check) and is
|
||||
// false otherwise. The improving flag is used in various pruning heuristics.
|
||||
improving = (ss - 2)->staticEval != VALUE_NONE
|
||||
? ss->staticEval > (ss - 2)->staticEval
|
||||
: (ss - 4)->staticEval != VALUE_NONE && ss->staticEval > (ss - 4)->staticEval;
|
||||
improving = ss->staticEval > (ss - 2)->staticEval;
|
||||
|
||||
opponentWorsening = ss->staticEval + (ss - 1)->staticEval > 2;
|
||||
|
||||
|
|
Loading…
Add table
Reference in a new issue