📦 NEW: Include best move in data gen

princesslana · Jan 28, 2024 · 48f5734 · 48f5734
1 parent fcc75dc
commit 48f5734
Show file tree

Hide file tree

Showing 2 changed files with 8 additions and 3 deletions.
diff --git a/src/bin/train-value.rs b/src/bin/train-value.rs
@@ -1,4 +1,4 @@
-use princhess::train::{ValueNetwork, TrainingPosition};
+use princhess::train::{TrainingPosition, ValueNetwork};
 
 use goober::{FeedForwardNetwork, OutputLayer, Vector};
 use std::env;

diff --git a/src/train/data.rs b/src/train/data.rs
@@ -13,13 +13,15 @@ pub struct TrainingPosition {
     occupied: Bitboard,
     pieces: [u8; 16],
     stm: Color,
-    result: i8,
 
-    #[allow(dead_code)]
+    result: i8,
     evaluation: i32,
 
     previous_moves: [Move; 4],
 
+    #[allow(dead_code)]
+    best_move: Move,
+
     #[allow(dead_code)]
     legal_moves: [Move; TrainingPosition::MAX_MOVES],
 
@@ -131,6 +133,8 @@ impl From<&SearchTree> for TrainingPosition {
             v => pv.sum_rewards() / i64::from(v),
         } as i32;
 
+        let best_move = *pv.get_move();
+
         // white relative evaluation
         evaluation = stm
             .fold(evaluation, -evaluation)
@@ -147,6 +151,7 @@ impl From<&SearchTree> for TrainingPosition {
             result,
             evaluation,
             previous_moves,
+            best_move,
             legal_moves,
             visits,
         }