Struct SearchTree

pub struct SearchTree<P, G, E, A>
where
    P: Player<E>,
    G: GameState<P, E, A>,
    E: EndStatus,
    A: Action,
{ /* private fields */ }

SearchTree is the main struct to use for Monte Carlo Tree Search. Pass a GameState wrapped in a RC to SearchTree::new to create a new search tree. Then you can call SearchTree::search to get the best action and SearchTree::renew to move to the next state.

Implementations

impl<P, G, E, A> SearchTree<P, G, E, A>

where P: Player<E>, G: GameState<P, E, A>, E: EndStatus, A: Action,

pub fn new(game_state: Rc<G>) -> Self

Create a new search tree.

Examples found in repository

examples/tictactoe.rs (line 51)

fn main() {
    let mut game = Rc::new(TictactoeGame::new());
    let mut search_tree = mctser::SearchTree::new(game.clone());

    while game.end_status.is_none() {
        let selected = search_tree.search(1000).unwrap();
        search_tree.renew(&selected).unwrap();
        game = search_tree.get_game_state();
        game.draw_board();
    }
}

pub fn with_tree_policy( self, tree_policy: impl Fn(f32, f32, f32) -> f32 + 'static, ) -> Self

Set the tree policy function. By default, it is UCT tree policy.

pub fn search(&self, n: u32) -> Option<A>

Search for the best action.

Examples found in repository

examples/tictactoe.rs (line 54)

fn main() {
    let mut game = Rc::new(TictactoeGame::new());
    let mut search_tree = mctser::SearchTree::new(game.clone());

    while game.end_status.is_none() {
        let selected = search_tree.search(1000).unwrap();
        search_tree.renew(&selected).unwrap();
        game = search_tree.get_game_state();
        game.draw_board();
    }
}

pub fn renew(&mut self, action: &A) -> Result<(), String>

Move to the next state and renew the root node with given action.

Examples found in repository

examples/tictactoe.rs (line 55)

fn main() {
    let mut game = Rc::new(TictactoeGame::new());
    let mut search_tree = mctser::SearchTree::new(game.clone());

    while game.end_status.is_none() {
        let selected = search_tree.search(1000).unwrap();
        search_tree.renew(&selected).unwrap();
        game = search_tree.get_game_state();
        game.draw_board();
    }
}

pub fn get_game_state(&self) -> Rc<G>

Get the current game state.

Examples found in repository

examples/tictactoe.rs (line 56)

fn main() {
    let mut game = Rc::new(TictactoeGame::new());
    let mut search_tree = mctser::SearchTree::new(game.clone());

    while game.end_status.is_none() {
        let selected = search_tree.search(1000).unwrap();
        search_tree.renew(&selected).unwrap();
        game = search_tree.get_game_state();
        game.draw_board();
    }
}

pub fn root_node(&self) -> Rc<RefCell<Node<P, G, E, A>>>

Get the root node.