From b50dcd7ddee7c5f59a2a23daeec09e5cc378fcaf Mon Sep 17 00:00:00 2001
From: Joost VandeVondele <Joost.VandeVondele@gmail.com>
Date: Wed, 23 Dec 2020 22:42:42 +0100
Subject: [PATCH] allow for repeated searches in rescoring

allows for repeating a depth N search K times.
Repeated searches improve the quality of eval, but don't bring in higher depth info.
Might allow for removing some of the noise in low depth scoring.
---
 docs/transform.md       |  2 ++
 src/learn/transform.cpp | 14 ++++++++++++++
 2 files changed, 16 insertions(+)

diff --git a/docs/transform.md b/docs/transform.md
index a0a7ad75..486fd34e 100644
--- a/docs/transform.md
+++ b/docs/transform.md
@@ -38,3 +38,5 @@ Currently the following options are available:
 
 `keep_moves` - whether to keep moves from the input file if available. Allows to keep compression in .binpack. Default: 1.
 
+`research_count` - number of additional searches of depth N done on the same position before using the eval. Default: 0.
+
diff --git a/src/learn/transform.cpp b/src/learn/transform.cpp
index 77671c65..8991b9f1 100644
--- a/src/learn/transform.cpp
+++ b/src/learn/transform.cpp
@@ -53,11 +53,13 @@ namespace Learner
         std::string input_filename = "in.epd";
         std::string output_filename = "out.binpack";
         int depth = 3;
+        int research_count = 0;
         bool keep_moves = true;
 
         void enforce_constraints()
         {
             depth = std::max(1, depth);
+            research_count = std::max(0, research_count);
         }
     };
 
@@ -293,7 +295,12 @@ namespace Learner
                 pos.set(*fen, false, &si, &th);
                 pos.state()->rule50 = 0;
 
+
+                for (int cnt = 0; cnt < params.research_count; ++cnt)
+                    Search::search(pos, params.depth, 1);
+
                 auto [search_value, search_pv] = Search::search(pos, params.depth, 1);
+
                 if (search_pv.empty())
                     continue;
 
@@ -400,7 +407,11 @@ namespace Learner
                 {
                     pos.set_from_packed_sfen(ps.sfen, &si, &th);
 
+                    for (int cnt = 0; cnt < params.research_count; ++cnt)
+                        Search::search(pos, params.depth, 1);
+
                     auto [search_value, search_pv] = Search::search(pos, params.depth, 1);
+
                     if (search_pv.empty())
                         continue;
 
@@ -461,6 +472,8 @@ namespace Learner
                 is >> params.output_filename;
             else if (token == "keep_moves")
                 is >> params.keep_moves;
+            else if (token == "research_count")
+                is >> params.research_count;
         }
 
         params.enforce_constraints();
@@ -470,6 +483,7 @@ namespace Learner
         std::cout << "input_file          : " << params.input_filename << '\n';
         std::cout << "output_file         : " << params.output_filename << '\n';
         std::cout << "keep_moves          : " << params.keep_moves << '\n';
+        std::cout << "research_count      : " << params.research_count << '\n';
         std::cout << '\n';
 
         do_rescore(params);