mctrust 0.2.0

Production-grade Monte Carlo Tree Search with UCT, RAVE, and pluggable environments
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48

use mctrust::{Environment, GameSearch, GameState, Reward, SearchConfig};

#[derive(Clone)]
struct CountingGame {
    value: i32,
    target: i32,
}

#[derive(Clone, Debug, PartialEq)]
enum Move {
    Increment,
    Decrement,
}

impl Environment for CountingGame {
    type Action = Move;

    fn legal_actions(&self) -> Vec<Move> {
        vec![Move::Increment, Move::Decrement]
    }

    fn apply(&mut self, action: &Move) {
        match action {
            Move::Increment => self.value += 1,
            Move::Decrement => self.value -= 1,
        }
    }

    fn evaluate(&self) -> GameState {
        if self.value == self.target {
            GameState::Win(Reward::WIN)
        } else {
            GameState::Ongoing
        }
    }
}

fn main() {
    let game = CountingGame {
        value: 0,
        target: 5,
    };
    let config = SearchConfig::builder().iterations(1_000).build();
    let mut search = GameSearch::new(game, config);

    let best_move = search.run();
    println!("Best move: {:?}", best_move);
}