A chess-based kotlin implementation of the Monte Carlo Tree Search which also uses the UCB1 algorithm to select the best child node to explore next during the tree search iteration.
-
Notifications
You must be signed in to change notification settings - Fork 0
Adversing/mcts.kt
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
A chess-based kotlin implementation of the Monte Carlo Tree Search
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published