A fast C++ impementation of Monte Carlo Tree Search with abstract classes that a user of this library can extend in order to use it. To demonstrate it I apply it to the game of Quoridor.
Stars
47
Forks
10
Watchers
47
Open Issues
2
Overall repository health assessment
No package.json found
This might not be a Node.js project
42
commits
Thinking time adjustments for no walls + #define TEST_ALL_MOVES option
98fbb24View on GitHubOrder moves at root level based on their winrates and print them as statistics
ad7674aView on GitHubYet another bug fix in legal_step() + Consider ALL moves for the tree option
c2bad09View on GitHubFixed bug in walls[][] init + seed randomness only once
2bd9a0cView on GitHub