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

Fewest Moves sorting after 2 attempts #62

Open
timreyn opened this issue Mar 15, 2020 · 0 comments
Open

Fewest Moves sorting after 2 attempts #62

timreyn opened this issue Mar 15, 2020 · 0 comments

Comments

@timreyn
Copy link

timreyn commented Mar 15, 2020

For Fewest Moves mo3, after 2 attempts, the results are a little misleading. Yesterday at Cambridge Challenge, the competitor in first place after 2 attempts had a DNF on the second attempt, so he wasn't "really" winning. This means competitors will often do the math themselves of adding up the first two results. It would be nice if WCA live did this for you, and used that as the ranking.

I propose sorting competitors by mo2 after they have two times entered. Competitors who are tied on average with "no average yet", who don't have anything entered in their third solve, should have their tie broken first by the mean of their first two, then by best.

This won't affect what's output to the WCA site, because competitors need to have all 3 solves entered.

Thanks!

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