kate/BadFish
1
0
Fork 0
mirror of https://github.com/sockspls/badfish synced 2025-04-30 08:43:09 +00:00
Code Issues Releases Wiki Activity

Simplify a condition in search()

Browse source 
And rearrange best value update in case of SpNode.

No functional change.
This commit is contained in:
Marco Costalba 2013-01-13 12:34:31 +01:00
parent 3a836dab59
commit 3b14b17664
1 changed files with 8 additions and 11 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

19
src/search.cpp
View file

@ -902,7 +902,7 @@ split_point_start: // At split points actual search starts from here
continue;
}
pvMove = PvNode ? moveCount == 1 : false;
pvMove = PvNode && moveCount == 1;
ss->currentMove = move;
if (!SpNode && !captureOrPromotion && playedMoveCount < 64)
movesSearched[playedMoveCount++] = move;
@ -994,24 +994,21 @@ split_point_start: // At split points actual search starts from here
if (value > bestValue)
{
bestValue = value;
if (SpNode) sp->bestValue = value;
bestValue = SpNode ? sp->bestValue = value : value;
if (value > alpha)
{
bestMove = move;
if (SpNode) sp->bestMove = move;
bestMove = SpNode ? sp->bestMove = move : move;
if (PvNode && value < beta)
{
alpha = value; // Update alpha here! Always alpha < beta
if (SpNode) sp->alpha = value;
}
if (PvNode && value < beta) // Update alpha! Always alpha < beta
alpha = SpNode ? sp->alpha = value : value;
else
{
assert(value >= beta); // Fail high
if (SpNode) sp->cutoff = true;
if (SpNode)
sp->cutoff = true;
break;
}
}