summary |
shortlog |
log |
commit | commitdiff |
tree
raw |
patch |
inline | side by side (from parent 1:
3a836da)
And rearrange best value update in case of SpNode.
No functional change.
- pvMove = PvNode ? moveCount == 1 : false;
+ pvMove = PvNode && moveCount == 1;
ss->currentMove = move;
if (!SpNode && !captureOrPromotion && playedMoveCount < 64)
movesSearched[playedMoveCount++] = move;
ss->currentMove = move;
if (!SpNode && !captureOrPromotion && playedMoveCount < 64)
movesSearched[playedMoveCount++] = move;
- bestValue = value;
- if (SpNode) sp->bestValue = value;
+ bestValue = SpNode ? sp->bestValue = value : value;
- 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
else
{
assert(value >= beta); // Fail high
- if (SpNode) sp->cutoff = true;
+ if (SpNode)
+ sp->cutoff = true;
+