Struct minimax::strategies::iterative::IterativeSearch

pub struct IterativeSearch<E: Evaluator> { /* private fields */ }

Implementations

impl<E: Evaluator> IterativeSearch<E>where <E::G as Game>::M: Copy + Eq, <E::G as Game>::S: Clone,

pub fn new(eval: E, opts: IterativeOptions) -> IterativeSearch<E>

pub fn stats(&self, s: &mut <E::G as Game>::S) -> String

Return a human-readable summary of the last move generation.

Trait Implementations

impl<E: Evaluator> Strategy<<E as Evaluator>::G> for IterativeSearch<E>where <E::G as Game>::S: Clone, <E::G as Game>::M: Copy + Eq,

fn choose_move(&mut self, s: &<E::G as Game>::S) -> Option<<E::G as Game>::M>

fn set_timeout(&mut self, max_time: Duration)

For strategies that can ponder indefinitely, set the timeout. This can be changed between calls to choose_move.

fn set_max_depth(&mut self, depth: u8)

Set the maximum depth to evaluate (instead of the timeout). This can be changed between calls to choose_move.

fn principal_variation(&self) -> Vec<<E::G as Game>::M>

From the last choose_move call, return the principal variation, i.e. the best sequence of moves for both players.