mct-rs 0.4.1

A fast, flexible, and simple implementation of Monte Carlo Tree Search (MCTS) algorithm in Rust
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

use crate::{action::Action, mdp::MDP, rand::genrand};

pub trait RolloutPolicy<M, S, A> {
    fn pick(&self, state: &S, actions: &Vec<A>) -> A;
}

pub struct RandomRollout;

impl RandomRollout {
    pub fn new() -> Self {
        Self
    }
}

impl<M, S, A> RolloutPolicy<M, S, A> for RandomRollout
where
    M: MDP<S, A>,
    A: Action,
{
    fn pick(&self, _state: &S, actions: &Vec<A>) -> A {
        if actions.len() == 1 {
            return actions[0];
        }

        let index = genrand(0, actions.len());
        return actions[index];
    }
}