Efficeint Monte-Carlo Tree Search in Rust
This is still in development and not stable.
This project's goal is to generalize the implementation of Monte-Carlo Tree Search (MCTS) in Rust, along with as many performance improvements as possible. It's currently intended for use in a Hex AI made in Rust.
Licensed under either of
- Apache License, Version 2.0 (LICENSE-APACHE or http://www.apache.org/licenses/LICENSE-2.0)
- MIT license (LICENSE-MIT or http://opensource.org/licenses/MIT)
at your option.
Unless you explicitly state otherwise, any contribution intentionally submitted for inclusion in the work by you, as defined in the Apache-2.0 license, shall be dual licensed as above, without any additional terms or conditions.