Merge branch 'simplify_eval' of https://github.com/glinscott/Stockfish

[stockfish] / src / search.cpp

diff --git a/src/search.cpp b/src/search.cpp
index bb1836e0474d3afe7f7c321ab7b967d2331c8f12..35d1eb5b4a390e0a567793a18e6ba51080295a86 100644 (file)
--- a/src/search.cpp
+++ b/src/search.cpp
@@ -1008,7 +1008,8 @@ split_point_start: // At split points actual search starts from here
       // Step 19. Check for splitting the search
       if (   !SpNode
           &&  depth >= Threads.minimumSplitDepth
-          &&  Threads.slave_available(thisThread))
+          &&  Threads.slave_available(thisThread)
+          &&  thisThread->splitPointsSize < MAX_SPLITPOINTS_PER_THREAD)
       {
           assert(bestValue < beta);
 
@@ -1342,7 +1343,6 @@ split_point_start: // At split points actual search starts from here
     Bitboard b = (enemies ^ ksq) & newAtt & ~oldAtt;
     while (b)
     {
-        // Note that here we generate illegal "double move"!
         if (futilityBase + PieceValue[EG][pos.piece_on(pop_lsb(&b))] >= beta)
             return true;
     }