Fixes
This commit is contained in:
parent
be589de6f4
commit
23135b4386
@ -1,7 +1,8 @@
|
|||||||
#![recursion_limit = "256"]
|
#![recursion_limit = "256"]
|
||||||
|
|
||||||
use burn::backend::{Autodiff, Wgpu};
|
use burn::backend::Autodiff;
|
||||||
use burn::optim::AdamConfig;
|
use burn::optim::AdamConfig;
|
||||||
|
use burn_ndarray::NdArray;
|
||||||
use engine::mcts::MctsConfig;
|
use engine::mcts::MctsConfig;
|
||||||
use engine::training::train::{train, TrainingConfig};
|
use engine::training::train::{train, TrainingConfig};
|
||||||
// fn main() {
|
// fn main() {
|
||||||
@ -14,12 +15,12 @@ use engine::training::train::{train, TrainingConfig};
|
|||||||
// }
|
// }
|
||||||
|
|
||||||
fn main() {
|
fn main() {
|
||||||
type MyBackend = Wgpu<f32, i32>;
|
// type MyBackend = Wgpu<f32, i32>;
|
||||||
// type MyBackend = Cuda<f32, i32>;
|
// type MyBackend = Cuda<f32, i32>;
|
||||||
// type MyBackend = NdArray<f32, i32>;
|
type MyBackend = NdArray<f32, i32>;
|
||||||
type MyAutodiffBackend = Autodiff<MyBackend>;
|
type MyAutodiffBackend = Autodiff<MyBackend>;
|
||||||
let device = burn::backend::wgpu::WgpuDevice::default();
|
// let device = burn::backend::wgpu::WgpuDevice::default();
|
||||||
// let device = burn::backend::ndarray::NdArrayDevice::default();
|
let device = burn::backend::ndarray::NdArrayDevice::default();
|
||||||
// let device = burn::backend::cuda::CudaDevice::default();
|
// let device = burn::backend::cuda::CudaDevice::default();
|
||||||
|
|
||||||
let mcts_config = MctsConfig::new(100, 1.0, 0.05, 0.25);
|
let mcts_config = MctsConfig::new(100, 1.0, 0.05, 0.25);
|
||||||
|
|||||||
@ -5,9 +5,10 @@ use crate::net::model::ChessModel;
|
|||||||
use burn::prelude::Backend;
|
use burn::prelude::Backend;
|
||||||
use burn::Tensor;
|
use burn::Tensor;
|
||||||
use chess::BoardStatus::{Checkmate, Stalemate};
|
use chess::BoardStatus::{Checkmate, Stalemate};
|
||||||
use chess::Color::White;
|
use chess::Color::{Black, White};
|
||||||
use chess::Piece::{Bishop, Knight, Pawn, Queen, Rook};
|
use chess::Piece::{Bishop, Knight, Pawn, Queen, Rook};
|
||||||
use chess::{Board, ChessMove, Color, MoveGen, Piece, ALL_COLORS, ALL_PIECES};
|
use chess::{Board, ChessMove, Color, MoveGen, Piece, ALL_COLORS, ALL_PIECES};
|
||||||
|
use rand::SeedableRng;
|
||||||
use std::collections::HashMap;
|
use std::collections::HashMap;
|
||||||
use std::marker::PhantomData;
|
use std::marker::PhantomData;
|
||||||
|
|
||||||
@ -123,12 +124,25 @@ impl<B: Backend> Mcts<B> {
|
|||||||
let root = 0;
|
let root = 0;
|
||||||
nodes.push(Node::new(0.0, board_state.clone(), None));
|
nodes.push(Node::new(0.0, board_state.clone(), None));
|
||||||
|
|
||||||
|
// Expand root to create initial children and priors
|
||||||
self.expand(root, &mut nodes, model, device);
|
self.expand(root, &mut nodes, model, device);
|
||||||
|
|
||||||
// 👇 APPLY DIRICHLET NOISE HERE
|
// Apply Dirichlet noise to root children
|
||||||
self.add_dirichlet_noise(root, &mut nodes);
|
self.add_dirichlet_noise(root, &mut nodes);
|
||||||
|
|
||||||
for _ in 0..self.config.num_simulations {
|
// We'll batch leaf evaluations to reduce per-leaf model calls and device-host syncs.
|
||||||
|
let mut sims_done = 0usize;
|
||||||
|
let num_sims = self.config.num_simulations;
|
||||||
|
// Tunable batch size for NN evaluation. Small value is safe; larger values increase throughput on GPU.
|
||||||
|
let batch_max = 32usize;
|
||||||
|
|
||||||
|
while sims_done < num_sims {
|
||||||
|
// Collect a batch of leaf nodes (and their selection paths)
|
||||||
|
let mut leaf_nodes: Vec<usize> = Vec::new();
|
||||||
|
let mut leaf_paths: Vec<Vec<usize>> = Vec::new();
|
||||||
|
let mut leaf_states: Vec<Tensor<B, 4>> = Vec::new();
|
||||||
|
|
||||||
|
while leaf_nodes.len() < std::cmp::min(batch_max, num_sims - sims_done) {
|
||||||
let mut path = vec![root];
|
let mut path = vec![root];
|
||||||
let mut current = root;
|
let mut current = root;
|
||||||
|
|
||||||
@ -137,10 +151,83 @@ impl<B: Backend> Mcts<B> {
|
|||||||
path.push(current);
|
path.push(current);
|
||||||
}
|
}
|
||||||
|
|
||||||
let value: f32 = self.expand(current, &mut nodes, model, device);
|
// Record leaf node and its path
|
||||||
|
leaf_nodes.push(current);
|
||||||
|
leaf_paths.push(path.clone());
|
||||||
|
|
||||||
let color = nodes[current].board_state.board.side_to_move();
|
// Prepare state tensor for this leaf
|
||||||
self.backpropagate(&mut nodes, &path, value, color);
|
let state: Tensor<B, 4> = encode_board_state_perspective(&nodes[current].board_state, device)
|
||||||
|
.reshape([1, 18, 8, 8]);
|
||||||
|
leaf_states.push(state);
|
||||||
|
|
||||||
|
sims_done += 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
if leaf_nodes.is_empty() {
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
|
||||||
|
// Batch evaluate the collected leaf states
|
||||||
|
let batch = Tensor::cat(leaf_states, 0);
|
||||||
|
let (policy_batch, value_batch) = model.forward(batch);
|
||||||
|
|
||||||
|
// Move tensors to host once per batch
|
||||||
|
let policy_data = policy_batch.into_data().to_vec::<f32>().unwrap();
|
||||||
|
let value_data = value_batch.into_data().to_vec::<f32>().unwrap();
|
||||||
|
|
||||||
|
let num_moves = policy_data.len() / leaf_nodes.len();
|
||||||
|
|
||||||
|
// Process each evaluated leaf: expand and backpropagate
|
||||||
|
for (i, &node_idx) in leaf_nodes.iter().enumerate() {
|
||||||
|
let path = &leaf_paths[i];
|
||||||
|
|
||||||
|
// slice for this sample's logits
|
||||||
|
let start = i * num_moves;
|
||||||
|
let end = start + num_moves;
|
||||||
|
let logits = &policy_data[start..end];
|
||||||
|
|
||||||
|
// Convert logits to probabilities with a numerically-stable softmax on host
|
||||||
|
let mut max_logit = std::f32::NEG_INFINITY;
|
||||||
|
for &v in logits.iter() {
|
||||||
|
if v > max_logit {
|
||||||
|
max_logit = v;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
let mut exps_sum = 0.0f32;
|
||||||
|
// We'll build a Vec<f32> of probabilities lazily when needed
|
||||||
|
let mut probs: Vec<f32> = Vec::new();
|
||||||
|
probs.resize(num_moves, 0.0);
|
||||||
|
for (j, &v) in logits.iter().enumerate() {
|
||||||
|
let e = (v - max_logit).exp();
|
||||||
|
probs[j] = e;
|
||||||
|
exps_sum += e;
|
||||||
|
}
|
||||||
|
if exps_sum > 0.0 {
|
||||||
|
for p in probs.iter_mut() {
|
||||||
|
*p /= exps_sum;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// Expand: add legal moves as children with prior from probs
|
||||||
|
let legal_moves: Vec<ChessMove> = MoveGen::new_legal(&nodes[node_idx].board_state.board).collect();
|
||||||
|
for mv in legal_moves {
|
||||||
|
let stm = nodes[node_idx].board_state.board.side_to_move();
|
||||||
|
let idx = encode_move(mv, stm);
|
||||||
|
let prior = probs[idx];
|
||||||
|
|
||||||
|
let mut new_board = nodes[node_idx].board_state.clone();
|
||||||
|
new_board.apply_move(mv);
|
||||||
|
|
||||||
|
let child_idx = nodes.len();
|
||||||
|
nodes.push(Node::new(prior, new_board, Some(mv)));
|
||||||
|
nodes[node_idx].children.push(child_idx);
|
||||||
|
}
|
||||||
|
|
||||||
|
// Backpropagate the value for this leaf
|
||||||
|
let value = value_data[i];
|
||||||
|
let color = nodes[node_idx].board_state.board.side_to_move();
|
||||||
|
self.backpropagate(&mut nodes, path, value, color);
|
||||||
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
let mut move_dist: HashMap<ChessMove, f32> = HashMap::new(); // TODO: make vec<(Chessmove, f32)>
|
let mut move_dist: HashMap<ChessMove, f32> = HashMap::new(); // TODO: make vec<(Chessmove, f32)>
|
||||||
@ -161,6 +248,24 @@ impl<B: Backend> Mcts<B> {
|
|||||||
model: &ChessModel<B>,
|
model: &ChessModel<B>,
|
||||||
device: &B::Device,
|
device: &B::Device,
|
||||||
) -> f32 {
|
) -> f32 {
|
||||||
|
if arena[node_idx].board_state.status == BoardStateStatus::Stalemate
|
||||||
|
|| arena[node_idx].board_state.status == BoardStateStatus::Threefold
|
||||||
|
|| arena[node_idx].board_state.status == BoardStateStatus::FiftyMove
|
||||||
|
{
|
||||||
|
0.0
|
||||||
|
} else if arena[node_idx].board_state.status == BoardStateStatus::WhiteWinner {
|
||||||
|
if arena[node_idx].board_state.board.side_to_move() == Black {
|
||||||
|
1.0
|
||||||
|
} else {
|
||||||
|
-1.0
|
||||||
|
}
|
||||||
|
} else if arena[node_idx].board_state.status == BoardStateStatus::BlackWinner {
|
||||||
|
if arena[node_idx].board_state.board.side_to_move() == White {
|
||||||
|
1.0
|
||||||
|
} else {
|
||||||
|
-1.0
|
||||||
|
}
|
||||||
|
} else {
|
||||||
let state: Tensor<B, 4> =
|
let state: Tensor<B, 4> =
|
||||||
encode_board_state_perspective(&arena[node_idx].board_state, device)
|
encode_board_state_perspective(&arena[node_idx].board_state, device)
|
||||||
.reshape([1, 18, 8, 8]);
|
.reshape([1, 18, 8, 8]);
|
||||||
@ -189,6 +294,7 @@ impl<B: Backend> Mcts<B> {
|
|||||||
|
|
||||||
value_head.into_data().to_vec().unwrap()[0]
|
value_head.into_data().to_vec().unwrap()[0]
|
||||||
}
|
}
|
||||||
|
}
|
||||||
|
|
||||||
fn backpropagate(&mut self, nodes: &mut [Node], path: &[usize], value: f32, color: Color) {
|
fn backpropagate(&mut self, nodes: &mut [Node], path: &[usize], value: f32, color: Color) {
|
||||||
for &idx in path {
|
for &idx in path {
|
||||||
@ -229,9 +335,14 @@ fn dirichlet_sample(size: usize, alpha: f32) -> Vec<f32> {
|
|||||||
|
|
||||||
let gamma = Gamma::new(alpha as f64, 1.0).unwrap();
|
let gamma = Gamma::new(alpha as f64, 1.0).unwrap();
|
||||||
|
|
||||||
let mut samples: Vec<f32> = (0..size)
|
// Use a single SmallRng seeded from system time (avoid depending on thread_rng helper)
|
||||||
.map(|_| gamma.sample(&mut rand::rng()) as f32)
|
let now = std::time::SystemTime::now()
|
||||||
.collect();
|
.duration_since(std::time::UNIX_EPOCH)
|
||||||
|
.unwrap();
|
||||||
|
let seed = now.as_nanos() as u64;
|
||||||
|
let mut rng = rand::rngs::SmallRng::seed_from_u64(seed);
|
||||||
|
|
||||||
|
let mut samples: Vec<f32> = (0..size).map(|_| gamma.sample(&mut rng) as f32).collect();
|
||||||
|
|
||||||
let sum: f32 = samples.iter().sum();
|
let sum: f32 = samples.iter().sum();
|
||||||
|
|
||||||
@ -334,8 +445,6 @@ pub fn heuristic_eval(board: &Board, perspective: Color) -> f32 {
|
|||||||
}
|
}
|
||||||
|
|
||||||
value
|
value
|
||||||
|
|
||||||
// board.checkers()
|
|
||||||
}
|
}
|
||||||
|
|
||||||
#[derive(Debug, Clone, Copy, PartialEq, Eq)]
|
#[derive(Debug, Clone, Copy, PartialEq, Eq)]
|
||||||
|
|||||||
@ -6,14 +6,15 @@ use burn::optim::{AdamConfig, GradientsParams, Optimizer};
|
|||||||
use burn::record::{FullPrecisionSettings, NamedMpkFileRecorder};
|
use burn::record::{FullPrecisionSettings, NamedMpkFileRecorder};
|
||||||
use burn::tensor::backend::AutodiffBackend;
|
use burn::tensor::backend::AutodiffBackend;
|
||||||
use chess::ChessMove;
|
use chess::ChessMove;
|
||||||
use rand::rngs::ThreadRng;
|
use rand::rngs::SmallRng;
|
||||||
use rand::seq::SliceRandom;
|
use rand::seq::SliceRandom;
|
||||||
use rand::RngExt;
|
use rand::{RngExt, SeedableRng};
|
||||||
use std::collections::{HashMap, VecDeque};
|
use std::collections::{HashMap, VecDeque};
|
||||||
use std::marker::PhantomData;
|
use std::marker::PhantomData;
|
||||||
use std::sync::atomic::{AtomicBool, Ordering};
|
use std::sync::atomic::{AtomicBool, Ordering};
|
||||||
use std::sync::Arc;
|
use std::sync::Arc;
|
||||||
use std::time::Instant;
|
use std::time::Instant;
|
||||||
|
use std::time::{SystemTime, UNIX_EPOCH};
|
||||||
|
|
||||||
pub struct TrainingConfig {
|
pub struct TrainingConfig {
|
||||||
pub max_time_s: Option<u64>,
|
pub max_time_s: Option<u64>,
|
||||||
@ -35,8 +36,8 @@ pub fn train<B: AutodiffBackend>(training_config: TrainingConfig, device: B::Dev
|
|||||||
let model_path = format!("artifacts/{}", training_config.model_name.as_str());
|
let model_path = format!("artifacts/{}", training_config.model_name.as_str());
|
||||||
println!("Creating model...");
|
println!("Creating model...");
|
||||||
let mut model: ChessModel<B> = ChessModelConfig::init(
|
let mut model: ChessModel<B> = ChessModelConfig::init(
|
||||||
training_config.hidden_channels,
|
|
||||||
training_config.num_blocks,
|
training_config.num_blocks,
|
||||||
|
training_config.hidden_channels,
|
||||||
&device,
|
&device,
|
||||||
);
|
);
|
||||||
if training_config.load_model {
|
if training_config.load_model {
|
||||||
@ -67,7 +68,14 @@ pub fn train<B: AutodiffBackend>(training_config: TrainingConfig, device: B::Dev
|
|||||||
_marker: PhantomData,
|
_marker: PhantomData,
|
||||||
};
|
};
|
||||||
|
|
||||||
let mut rng = rand::rng();
|
// Create RNG once and reuse it for sampling and shuffling
|
||||||
|
// Seed from system time (platform default entropy may be unavailable in some contexts)
|
||||||
|
let now = SystemTime::now().duration_since(UNIX_EPOCH).unwrap();
|
||||||
|
let seed = now.as_nanos() as u64;
|
||||||
|
let mut rng = SmallRng::seed_from_u64(seed);
|
||||||
|
|
||||||
|
// Initialize optimizer once so state (moments) persist across steps
|
||||||
|
let mut optim = training_config.optimizer.init();
|
||||||
|
|
||||||
println!("Starting training...");
|
println!("Starting training...");
|
||||||
while train.load(Ordering::Relaxed) {
|
while train.load(Ordering::Relaxed) {
|
||||||
@ -140,8 +148,6 @@ pub fn train<B: AutodiffBackend>(training_config: TrainingConfig, device: B::Dev
|
|||||||
|
|
||||||
let batch = batcher.batch(samples, &device);
|
let batch = batcher.batch(samples, &device);
|
||||||
|
|
||||||
let mut optim = training_config.optimizer.init();
|
|
||||||
|
|
||||||
let output = model.forward_chess(batch.states, batch.policy_targets, batch.value_targets);
|
let output = model.forward_chess(batch.states, batch.policy_targets, batch.value_targets);
|
||||||
|
|
||||||
let grads = output.loss.backward();
|
let grads = output.loss.backward();
|
||||||
@ -221,7 +227,7 @@ fn apply_temperature(
|
|||||||
adjusted
|
adjusted
|
||||||
}
|
}
|
||||||
|
|
||||||
fn sample_move(dist: &HashMap<ChessMove, f32>, rng: &mut ThreadRng) -> Option<ChessMove> {
|
fn sample_move(dist: &HashMap<ChessMove, f32>, rng: &mut SmallRng) -> Option<ChessMove> {
|
||||||
let mut r: f32 = rng.random_range(0.0..1.0);
|
let mut r: f32 = rng.random_range(0.0..1.0);
|
||||||
|
|
||||||
for (m, p) in dist {
|
for (m, p) in dist {
|
||||||
|
|||||||
Loading…
Reference in New Issue
Block a user