1 files changed, 0 insertions, 53 deletions
diff --git a/src/searchsup.c b/src/searchsup.c
index 54e1814..72667c8 100644
--- a/src/searchsup.c
+++ b/src/searchsup.c
@@ -24,59 +24,6 @@ extern SCORE g_iRootScore[2];
 extern ULONG g_uHardExtendLimit;
 extern ULONG g_uIterateDepth;
 
-ULONG
-NumLeftoverMovesToSelect(IN SEARCHER_THREAD_CONTEXT *ctx, IN ULONG uDepth)
-/**
-
-Routine description:
-
-    How many "leftover" (below GOOD_MOVE -- see search.c's
-    TRY_GENERATED_MOVES gate) moves are worth a full SelectBestWithHistory
-    scan before we give up and just take the remainder in whatever order
-    they're sitting in. Only ever consulted once every high-performer
-    move (winning/even capture, killer, killer-mate) has already been
-    exhausted -- this never limits how many of *those* get selected,
-    only how much further care to spend on the ordinary/leftover tail.
-
-    Replaces the old g_uSearchSortLimits[ply], indexed by distance from
-    the root -- a poor proxy for what actually matters here, which is
-    how large the remaining subtree below this node is (distance from
-    root only correlates with that when total search depth is roughly
-    fixed; it says nothing once extensions/reductions/iterative-deepening
-    are in play). uDepth (remaining depth, in ONE_PLY units, possibly
-    fractional) is the more principled signal: a bigger remaining
-    subtree makes the cost of a few extra O(n) selection scans more
-    worth paying to avoid a bad early choice cascading into extra
-    full-width re-searches.
-
-    STARTING POINT, NOT YET VALIDATED under this new meaning: this
-    reuses the previous table's six numbers verbatim, just reindexed by
-    plies of *remaining* depth instead of *distance from root* -- same
-    overall shape (more care with more depth left), same specific
-    values, carried over only because they're a known, testable
-    starting point, not because they were ever confirmed correct here.
-
-Parameters:
-
-    IN SEARCHER_THREAD_CONTEXT *ctx,
-    IN ULONG uDepth
-
-Return value:
-
-    ULONG
-
-**/
-{
-    static const ULONG _uLimits[] = { 8, 9, 11, 13, 15, 17 };
-    ULONG uPlies = uDepth / ONE_PLY;
-
-    if (uPlies >= ARRAY_LENGTH(_uLimits))
-    {
-        uPlies = ARRAY_LENGTH(_uLimits) - 1;
-    }
-    return(_uLimits[uPlies]);
-}
-
 void
 UpdatePV(SEARCHER_THREAD_CONTEXT *ctx, MOVE mv)
 /**