The --gearbox test case generator now includes SAN movelist.

cosinekitty · cosinekitty · commit 7f26265b5129 · 2020-11-28T15:27:17.000-05:00
In addition to the longmove list, include a SAN list for helping
test SAN functionality in Gearbox. I eliminated the filtering logic
because I wrote a separate Python program to do more sophisticated,
yet much faster filtering.
diff --git a/src/portable.cpp b/src/portable.cpp
@@ -240,13 +240,7 @@ int MakeGearboxUnitTest(const char *inPgnFileName, const char *outFileName)
         Move            move;
         UnmoveInfo      unmove;
         int             ply = 0;
-        bool            skipThisGame = false;
-
-        int totalGameCount = 0;
-        int keptGameCount = 0;
-
-        const int MIN_ELO = 2600;
-        const int GAME_LIMIT = 1000;
+        int             totalGameCount = 0;
 
         rc = 0;
 
@@ -257,20 +251,10 @@ int MakeGearboxUnitTest(const char *inPgnFileName, const char *outFileName)
                 if (state == PGN_FILE_STATE_NEWGAME)
                 {
                     ++totalGameCount;
-                    skipThisGame = (info.whiteElo < MIN_ELO || info.blackElo < MIN_ELO);
-                    if (!skipThisGame)
-                    {
-                        if (keptGameCount == GAME_LIMIT)
-                            break;
-                        ++keptGameCount;
-                        ply = 0;        // signals reader that we are starting a new game
-                        board.Init();
-                    }
+                    ply = 0;        // signals reader that we are starting a new game
+                    board.Init();
                 }
 
-                if (skipThisGame)
-                    continue;
-
                 MoveList legal;
                 board.GenMoves(legal);
 
@@ -288,8 +272,9 @@ int MakeGearboxUnitTest(const char *inPgnFileName, const char *outFileName)
                     rc = 1;
                     goto failure_exit;
                 }
-
                 fprintf(outfile, "%d %s\n", ply, notation);
+
+                // Print all legal moves in longmove format.
                 for (int i=0; i < legal.num; ++i)
                 {
                     if (!FormatLongMove(board.WhiteToMove(), legal.m[i], notation))
@@ -305,6 +290,17 @@ int MakeGearboxUnitTest(const char *inPgnFileName, const char *outFileName)
                 }
                 fprintf(outfile, "\n");
 
+                // Print all legal moves in SAN/PGN format.
+                char san[MAX_MOVE_STRLEN + 1];
+                for (int i=0; i < legal.num; ++i)
+                {
+                    FormatChessMove(board, legal, legal.m[i], san);
+                    if (i > 0)
+                        fprintf(outfile, " ");
+                    fprintf(outfile, "%s", san);
+                }
+                fprintf(outfile, "\n");
+
                 board.MakeMove(move, unmove);
                 ++ply;
 
@@ -330,7 +326,7 @@ int MakeGearboxUnitTest(const char *inPgnFileName, const char *outFileName)
 failure_exit:
         fclose(outfile);
         if (rc == 0)
-            printf("Kept %d of %d games.\n", keptGameCount, totalGameCount);
+            printf("Processed %d games.\n", totalGameCount);
         else
             remove(outFileName);
     }
