|Brian Hicks e7e78093d1||2 weeks ago|
|nix||2 weeks ago|
|src||2 weeks ago|
|static/fonts||8 months ago|
|tests||2 weeks ago|
|.envrc||8 months ago|
|.gitignore||7 months ago|
|LICENSE||8 months ago|
|Makefile||7 months ago|
|README.md||8 months ago|
|default.nix||6 months ago|
|elm.json||2 weeks ago|
|modd.conf||8 months ago|
|shell.nix||7 months ago|
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 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:
You don't have to build anything. Go play with a live version at elo.bytes.zone.
But if you want to hack locally:
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.