krugd/rustic_mcts
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity
12 Commits 2 Branches 0 Tags
Go to file
Clone
Open with VS Code Open with VSCodium Open with Intellij IDEA
Download ZIP Download TAR.GZ Download BUNDLE
David Kruger 854772a63d Improve UCB1-Tuned performance 
We calculate the sample variance of the rewards online storing the value
in the node. This greatly reduces the amount of summations that need to
be done to calculate the variance during the selection phase.

While this burdens other selection algorithms, the cost is not
substantial.
2025-06-29 18:43:52 -07:00
benches
Adding really stupid benchmark
2025-06-27 22:25:56 -07:00
examples
Adding a basic print_tree function to visualize the MCTS search tree
2025-06-27 15:00:43 -07:00
src
Improve UCB1-Tuned performance
2025-06-29 18:43:52 -07:00
.gitignore
Adding gitingore for rust
2025-06-12 11:13:49 -07:00
Cargo.lock
Adding really stupid benchmark
2025-06-27 22:25:56 -07:00
Cargo.toml
Adding really stupid benchmark
2025-06-27 22:25:56 -07:00
LICENSE
Initial commit
2025-06-12 11:11:51 -07:00
README.md
Initial commit
2025-06-12 11:11:51 -07:00

README.md

rustic_mcts

An extensible implementation of Monte Carlo Tree Search (MCTS) using an arena allocator.

Description
An extensible implementation of Monte Carlo Tree Search (MCTS) using an arena allocator.
Readme MIT 106 KiB
Languages
Rust 100%