https://github.com/nicholas-miklaucic/rust-monaco

An optimized, parallel, lock-free Monte-Carlo Tree Search implementation in Rust
https://github.com/nicholas-miklaucic/rust-monaco

ai algorithm mcts rust

Last synced: about 1 month ago
JSON representation

An optimized, parallel, lock-free Monte-Carlo Tree Search implementation in Rust

• Host: GitHub
• URL: https://github.com/nicholas-miklaucic/rust-monaco
• Owner: nicholas-miklaucic
• Created: 2019-01-12T01:20:51.000Z (about 6 years ago)
• Default Branch: master
• Last Pushed: 2019-01-12T01:26:07.000Z (about 6 years ago)
• Last Synced: 2024-11-07T10:53:32.804Z (3 months ago)
• Topics: ai, algorithm, mcts, rust
• Language: Rust
• Size: 1000 Bytes
• Stars: 1
• Watchers: 2
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# Monaco

Efficeint Monte-Carlo Tree Search in Rust

## Warning

This is still in development and not stable.

## Summary

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.

## License

Licensed under either of

 * Apache License, Version 2.0

   ([LICENSE-APACHE](LICENSE-APACHE) or http://www.apache.org/licenses/LICENSE-2.0)

 * MIT license

   ([LICENSE-MIT](LICENSE-MIT) or http://opensource.org/licenses/MIT)

at your option.

## Contribution

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.