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

WSDC graph pairing algorithm #2595

Draft
wants to merge 1 commit into
base: develop
Choose a base branch
from

Conversation

teymour-aldridge
Copy link
Contributor

Work in progress

penalty = super().assignment_cost(t1, t2, size)
if penalty is None:
return None

# Add penalty for seeing the pullup again
has_pullup = 'pullup' in self.team_flags.get(t1, []) or 'pullup' in self.team_flags.get(t2, [])
if self.options["pullup_debates_penalty"] and has_pullup:
penalty += max(t1.pullup_debates, t2.pullup_debates) * self.options["pullup_debates_penalty"]
penalty += (t1.pullup_debates + t2.pullup_debates) * self.options["pullup_debates_penalty"]
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

This isn't exactly what you're looking for; this isn't a pullup penalty per se, but so that a team doesn't get put against the pullup team too often (an APDA rule; don't think there's an equivalent in WSDC)

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

Successfully merging this pull request may close these issues.

2 participants