A simple Monte Carlo Tree Search to find the best moves in a 3x3 Tic-Tac-Toe game. The code plays the game 10000 times and prints the learning process.
-
Notifications
You must be signed in to change notification settings - Fork 0
FjodorGit/SimpleMonteCarloTS
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
A simple Monte Carlo Tree Search to find the best moves in a 3x3 Tic-Tac-Toe game.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published