We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
According to the paper A Survey of Monte Carlo Tree Search Methods, the UCB function should look like this.
And here is the pseudo-code about the implementation.
The coefficient 2 should be outsize of the log. And this line of code is a little different from the paper https://github.com/haroldsultan/MCTS/blob/master/mcts.py#L115 .
2
log
The text was updated successfully, but these errors were encountered:
thanks. i corrected the code
Sorry, something went wrong.
Great and thanks for your sharing 🎉
No branches or pull requests
According to the paper A Survey of Monte Carlo Tree Search Methods, the UCB function should look like this.
And here is the pseudo-code about the implementation.
The coefficient
2
should be outsize of thelog
. And this line of code is a little different from the paper https://github.com/haroldsultan/MCTS/blob/master/mcts.py#L115 .The text was updated successfully, but these errors were encountered: