Struct NodePool 

pub struct NodePool<S: GameState> { /* private fields */ }

Pool for efficient node allocation in MCTS

This implementation provides memory reuse by creating and recycling nodes instead of frequently allocating and deallocating them. This can significantly improve performance in large MCTS searches.

Implementations

impl<S: GameState> NodePool<S>

pub fn new(template_state: S, initial_size: usize) -> Self

Creates a new node pool with the given template state

Arguments

• template_state - A template state that can be cloned when creating new nodes
• initial_size - Number of nodes to preallocate

pub fn create_node( &mut self, state: S, action: Option<S::Action>, parent_player: Option<S::Player>, depth: usize, ) -> MCTSNode<S>

Creates a new node, either from the pool or by allocating a new one

pub fn recycle_node(&mut self, node: MCTSNode<S>)

Recycles a node back to the pool for future reuse

pub fn recycle_tree(&mut self, root: MCTSNode<S>)

Recycles all nodes in a tree by recursively adding them to the pool

pub fn get_stats(&self) -> &NodePoolStats

Get statistics about pool utilization

pub fn available_nodes(&self) -> usize

Get current pool size (available nodes)

Trait Implementations

impl<S: GameState> Clone for NodePool<S>

fn clone(&self) -> Self

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.