Extended search #305
Closed
Extended search #305
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This also changes the code to use the node with the most plays instead of the best win ratio
|
Whoops. It seems that some tests are still failing! |
Instead just calculate the result twice. This is not in the part of the program that needs to be fast anyway. And doing it like this makes the code more understandable.
|
It turns out that this doesn't help at all. Even with a value of 10 it doesn't play better than the version without it. |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
If the best move selected by win ratio and number of plays don't agree continue searching.
Benchmarks are still outstanding to see if this even improves the strength or not.
Closes #209