Skip to content
New issue

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

The UCB algorithm is a little different from the paper #2

Closed
tobegit3hub opened this issue Oct 25, 2017 · 2 comments
Closed

The UCB algorithm is a little different from the paper #2

tobegit3hub opened this issue Oct 25, 2017 · 2 comments

Comments

@tobegit3hub
Copy link

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.

Uploading Screen Shot 2017-10-25 at 4.58.17 PM.png…

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 .

@haroldsultan
Copy link
Owner

thanks. i corrected the code

@tobegit3hub
Copy link
Author

Great and thanks for your sharing 🎉

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants