I love using idea fight to rank things.
It's pretty nice!
I can get an idea of the top item in a list in
O(n) time, and finding all values is
O(n log n) (see Rob Hoelz's blog post about idea fight.)
I've used idea fight for years, but recently I've been running into some problems when using it:
- I second-guess my choices. I'd like them to sort out over time instead of having to commit once.
- Some things are pretty equal, but the selection method means that choices below the "losing" choice are automatically lowered when I'd kind of like them to be higher.
- I can't see what's going on in the process when it's running.
- There's no undo.
I think most of these are caused by the fact that I often do not put a series of items with a strict objective ordering into the tool!
So I could give up on the nice
O(n) sorting time if I could get some of those benefits.
This is an exploration of sorting things with an Elo rating system. Essentially, it solves my problems in the following ways:
- If I second-guess a choice, it's fine. The match may come up again, and this style of ranking is only a rough order--it's fine if it's not strictly ordered!
- The rating system models ties, so if two things really are equal they will become closer in rank over time.
- I can see the rankings as I'm making choices.
- There's still no undo, but I can add it if I find that it's really a problem! (So far I haven't.)
You don't have to build anything. Go play with a live version at elo.bytes.zone.
But if you want to hack locally:
- have direnv and nix
- clone and
moddto start the development server (it will tell you where to go to view the result)
nix-buildto build a deployable version
The code in this repo is licensed under the BSD 3-Clause license (located at
LICENSE in the source.)
Open Sans (the font in the UI) is released under an Apache 2.0 license available at opensans.com.