Simple implementation of MCTS (UCT) algorithm
It's a cmake project, so if you want to run example you only need to :
mkdir build
cd build
And then :
cmake ..
If you want to implement your own version of MCTS
#include TreeNode.hYou have to define the abstract methods :
- expand() : how you expand your problem (depend of your context)
- rollOut(TreeNode* _node) : what is your simulation and roll out returned
- getBestChild() : what is for you the best child result
Note that by default, TreeNode abstract class use UCB selection :
- select() : selection method of next node to explore (UCB1 formula currently)