From cd27ed9a7460ccfa6106b190f46beb89c2f3150d Mon Sep 17 00:00:00 2001 From: Marco Costalba Date: Sat, 6 Aug 2011 11:19:13 +0100 Subject: [PATCH] Update comment on why we call root search with ss+1 No functional change. Signed-off-by: Marco Costalba --- src/search.cpp | 6 ++++-- 1 file changed, 4 insertions(+), 2 deletions(-) diff --git a/src/search.cpp b/src/search.cpp index 833bbba4..5a72d6b0 100644 --- a/src/search.cpp +++ b/src/search.cpp @@ -560,7 +560,8 @@ namespace { // Start with a small aspiration window and, in case of fail high/low, // research with bigger window until not failing high/low anymore. do { - // Search starting from ss+1 to allow calling update_gains() + // Search starting from ss+1 to allow referencing (ss-1). This is + // needed by update_gains() and ss copy when splitting at Root. value = search(pos, ss+1, alpha, beta, depth * ONE_PLY); // It is critical that sorting is done with a stable algorithm @@ -1170,7 +1171,6 @@ split_point_start: // At split points actual search starts from here alpha = sp->alpha; } - // Finished searching the move. If StopRequest is true, the search // was aborted because the user interrupted the search or because we // ran out of time. In this case, the return value of the search cannot @@ -2211,6 +2211,8 @@ void ThreadsManager::idle_loop(int threadID, SplitPoint* sp) { search(pos, ss+1, tsp->alpha, tsp->beta, tsp->depth); else if (tsp->nodeType == NonPV) search(pos, ss+1, tsp->alpha, tsp->beta, tsp->depth); + else + assert(false); assert(threads[threadID].state == Thread::SEARCHING); -- 2.39.2