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

Find another good heuristic to reduce first round #3

Open
janLo opened this issue Sep 27, 2014 · 0 comments
Open

Find another good heuristic to reduce first round #3

janLo opened this issue Sep 27, 2014 · 0 comments

Comments

@janLo
Copy link
Member

janLo commented Sep 27, 2014

The possible distributions for the first round can be calculated by

>>> import math
>>> def permcount(teams):
...   num = 1
...   for cnt in reversed(range(2,(((teams / 3) * 2) + 1),2)):
...     num = num * ((math.factorial(cnt) / math.factorial(cnt - 2)) / 2)
...   return num
...
>>> permcount(teamcount)

Which gives a 11 digit long number for only 24 teams - thats too much. The Firstround_team_selection already uses heuristics like "clever" sorting to get good solutions fast or slicing by max distance or teamcount per host - but I think it there must be a better solution.

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

1 participant