https://github.com/adversing/mcts.kt
A chess-based kotlin implementation of the Monte Carlo Tree Search
https://github.com/adversing/mcts.kt
algorithmic-prediction chess game-theory heuristic-search-algorithms kotlin montecarlo-tree-search
Last synced: 7 months ago
JSON representation
A chess-based kotlin implementation of the Monte Carlo Tree Search
- Host: GitHub
- URL: https://github.com/adversing/mcts.kt
- Owner: Adversing
- Created: 2024-06-22T01:12:47.000Z (over 1 year ago)
- Default Branch: main
- Last Pushed: 2024-06-22T01:32:58.000Z (over 1 year ago)
- Last Synced: 2025-02-12T16:32:22.767Z (9 months ago)
- Topics: algorithmic-prediction, chess, game-theory, heuristic-search-algorithms, kotlin, montecarlo-tree-search
- Language: Kotlin
- Homepage:
- Size: 6.84 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# mcts.kt
A chess-based kotlin implementation of the [Monte Carlo Tree Search](https://en.wikipedia.org/wiki/Monte_Carlo_tree_search) which also uses the [UCB1 algorithm](https://learn.microsoft.com/en-us/archive/msdn-magazine/2019/august/test-run-the-ucb1-algorithm-for-multi-armed-bandit-problems#understanding-the-ucb1-algorithm) to select the best child node to explore next during the tree search iteration.