krugd/rustic_mcts
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity
10 Commits 2 Branches 1 Tag
6a338182389a8847615d71dd8d51275df144a64e
T
Clone
Open with VS Code Open with VSCodium Open with Intellij IDEA
Download ZIP Download TAR.GZ Download BUNDLE
krugd 6a33818238 We propagate the reward for both sides 
The AI now properly choses the optimal path for the active player
2025-06-27 16:12:40 -07:00
examples
Adding a basic print_tree function to visualize the MCTS search tree
2025-06-27 15:00:43 -07:00
src
We propagate the reward for both sides
2025-06-27 16:12:40 -07:00
.gitignore
Adding gitingore for rust
2025-06-12 11:13:49 -07:00
Cargo.lock
Upgrade rand to ~0.9
2025-06-27 15:17:45 -07:00
Cargo.toml
Upgrade rand to ~0.9
2025-06-27 15:17:45 -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.

Reference in New Issue View Git Blame Copy Permalink
S
Description
An extensible implementation of Monte Carlo Tree Search (MCTS) using an arena allocator.
Readme MIT 110 KiB
Languages
Rust 100%