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

Retire dangerous flag

Browse source 
Replace by its value where it is used. Code is more clear that
way.

No functional change.

Resolves #402
This commit is contained in:
lucasart 2015-08-18 18:53:16 +08:00 • committed by Joona Kiiski
parent 69a1a808c8
commit c052e03426
1 changed files with 4 additions and 6 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

10
src/search.cpp
View file

@ -531,7 +531,7 @@ namespace {
Depth extension, newDepth, predictedDepth; Depth extension, newDepth, predictedDepth;
Value bestValue, value, ttValue, eval, nullValue, futilityValue; Value bestValue, value, ttValue, eval, nullValue, futilityValue;
bool ttHit, inCheck, givesCheck, singularExtensionNode, improving; bool ttHit, inCheck, givesCheck, singularExtensionNode, improving;
bool captureOrPromotion, dangerous, doFullDepthSearch; bool captureOrPromotion, doFullDepthSearch;
int moveCount, quietCount; int moveCount, quietCount;
// Step 1. Initialize node // Step 1. Initialize node
@ -847,10 +847,6 @@ moves_loop: // When in check and at SpNode search starts from here
? ci.checkSquares[type_of(pos.piece_on(from_sq(move)))] & to_sq(move) ? ci.checkSquares[type_of(pos.piece_on(from_sq(move)))] & to_sq(move)
: pos.gives_check(move, ci); : pos.gives_check(move, ci);
dangerous = givesCheck
|| type_of(move) != NORMAL
|| pos.advanced_pawn_push(move);
// Step 12. Extend checks // Step 12. Extend checks
if (givesCheck && pos.see_sign(move) >= VALUE_ZERO) if (givesCheck && pos.see_sign(move) >= VALUE_ZERO)
extension = ONE_PLY; extension = ONE_PLY;
@ -883,7 +879,9 @@ moves_loop: // When in check and at SpNode search starts from here
if ( !RootNode if ( !RootNode
&& !captureOrPromotion && !captureOrPromotion
&& !inCheck && !inCheck
&& !dangerous && !givesCheck
&& type_of(move) == NORMAL
&& !pos.advanced_pawn_push(move)
&& bestValue > VALUE_MATED_IN_MAX_PLY) && bestValue > VALUE_MATED_IN_MAX_PLY)
{ {
// Move count based pruning // Move count based pruning