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

Manage n+1 case #17

Open
xoco70 opened this issue Jan 30, 2018 · 0 comments
Open

Manage n+1 case #17

xoco70 opened this issue Jan 30, 2018 · 0 comments

Comments

@xoco70
Copy link
Owner

xoco70 commented Jan 30, 2018

When there is, for instance, 17 competitors in a direct elimination tree, there will have 15 BYES. We can improve that making the first match with 3 competitors.

You can use this technique to decrease number of BYES on the tree.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

1 participant