mcts4j
mcts4j copied to clipboard
A pure JAVA implementation of the Monte Carlo Tree Search algorithm.
Bumps [junit](https://github.com/junit-team/junit4) from 4.11 to 4.13.1. Release notes Sourced from junit's releases. JUnit 4.13.1 Please refer to the release notes for details. JUnit 4.13 Please refer to the release notes...
Backpropagate the information that the whole subtree has been explored/expanded using Node#terminal flag see #2
Hi, I have read your code of mcts4j (Monte-Carlo_tree_search) carefully and found it quite useful for me, it is really a nice work. However, I tested the program and found...
I study a little the source code but i was not able to find how to set the number of iterations in the tree search. I expected the method getBestTransition()...