Update cycle detection to be more efficient #809
Merged
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
meatballs
approved these changes
Jan 9, 2017
drvinceknight
approved these changes
Jan 9, 2017
| @@ -44,6 +44,13 @@ def strategy(self, opponent): | |||
| return C | |||
|
|
|||
|
|
|||
| def is_alternator(history): | |||
| for i in range(len(history) - 1): | |||
| if history[i] == history[i+1]: | |||
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.
Profiling indicates that
detect_cyclesis one most expensive functions in the library, so I rewrote it and the players that use it to be more efficient (without altering their behaviors significantly).This PR decreases tournament run time by approx 20%.