Trait minimax::interface::Strategy

pub trait Strategy<G: Game> {
    // Required method
    fn choose_move(&mut self, state: &G::S) -> Option<G::M>;

    // Provided methods
    fn set_timeout(&mut self, _timeout: Duration) { ... }
    fn set_max_depth(&mut self, _depth: u8) { ... }
    fn principal_variation(&self) -> Vec<G::M> { ... }
}

Defines a method of choosing a move for the current player.

Required Methods

fn choose_move(&mut self, state: &G::S) -> Option<G::M>

Provided Methods

fn set_timeout(&mut self, _timeout: 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<G::M>

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

Implementors

impl<E> Strategy<<E as Evaluator>::G> for ParallelSearch<E>where <E::G as Game>::S: Clone + Send + Sync, <E::G as Game>::M: Copy + Eq + Send + Sync, E: Clone + Sync + Send + 'static + Evaluator,

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,

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

impl<G> Strategy<G> for MonteCarloTreeSearch<G>where G: Sync + Game, G::S: Clone + Send, G::M: Copy + Sync,

impl<G: Game> Strategy<G> for Random<G>where G::M: Copy,