Faster rating calculation - #190
Open
alexeydergunov wants to merge 3 commits into
Open
Conversation
alexeydergunov
force-pushed
the
faster-rating-calculation
branch
from
August 30, 2026 23:47
d58d954 to
dcd1180
Compare
alexeydergunov
force-pushed
the
faster-rating-calculation
branch
from
August 30, 2026 23:53
dcd1180 to
cfdfe3a
Compare
This file contains hidden or 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
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
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.
First part can be calculated without bruteforce (
itertools.combinations).It's a classical math problem "choose
kofnitems to maximizesum(x[i]*w[i]) / sum(w[i])".Solution is a binary search.
Also, it opens a quick possible fix for smooth tournaments decay, which was discussed lately.
Just multiply the last element with 0.2 / 0.4 / 0.6 / 0.8 / 1.0