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.
| Name | Name | Last commit date | ||
|---|---|---|---|---|
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.