kate/BadFish
1
0
Fork 0
mirror of https://github.com/sockspls/badfish synced 2025-07-11 19:49:14 +00:00
Code Issues Releases Wiki Activity

Code style in Razoring and ProbCut

Browse source 
No functional change.
This commit is contained in:
joergoster 2018-03-02 11:38:11 +01:00 • committed by Stéphane Nicolet
parent 3192b09fe0
commit 43682d08f7
1 changed files with 15 additions and 13 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

28
src/search.cpp
View file

@ -682,20 +682,21 @@ namespace {
goto moves_loop;
// Step 7. Razoring (skipped when in check)
if ( !PvNode
&& depth <= ONE_PLY)
if ( !PvNode
&& depth <= 2 * ONE_PLY)
{
if (eval + RazorMargin1 <= alpha)
if ( depth == ONE_PLY
&& eval + RazorMargin1 <= alpha)
return qsearch<NonPV, false>(pos, ss, alpha, alpha+1);
}
else if ( !PvNode
&& depth <= 2 * ONE_PLY
&& eval + RazorMargin2 <= alpha)
{
Value ralpha = alpha - RazorMargin2;
Value v = qsearch<NonPV, false>(pos, ss, ralpha, ralpha+1);
if (v <= ralpha)
return v;
else if (eval + RazorMargin2 <= alpha)
{
Value ralpha = alpha - RazorMargin2;
Value v = qsearch<NonPV, false>(pos, ss, ralpha, ralpha+1);
if (v <= ralpha)
return v;
}
}
// Step 8. Futility pruning: child node (skipped when in check)
@ -776,7 +777,7 @@ namespace {
// Perform a preliminary search at depth 1 to verify that the move holds.
// We will only do this search if the depth is not 5, thus avoiding two
// searches at depth 1 in a row.
if (depth != 5 * ONE_PLY)
if (depth > 5 * ONE_PLY)
value = -search<NonPV>(pos, ss+1, -rbeta, -rbeta+1, ONE_PLY, !cutNode, true);
// If the first search was skipped or was performed and held, perform
@ -785,6 +786,7 @@ namespace {
value = -search<NonPV>(pos, ss+1, -rbeta, -rbeta+1, depth - 4 * ONE_PLY, !cutNode, false);
pos.undo_move(move);
if (value >= rbeta)
return value;
}