[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: Request for review of my Emacs project elosort
From: |
Sergey Lilo |
Subject: |
Re: Request for review of my Emacs project elosort |
Date: |
Wed, 4 Sep 2024 01:43:01 +0600 |
On Tue, Sep 3, 2024 at 9:34 PM Emanuel Berg <incal@dataswamp.org> wrote:
>
> Is the algorithm you setup explicitely what is on top for any
> two items, and you score points every time you are are
> prefered to something else?
>
> And then you sort by total score? That simple?
>
Yes, after some series of rating updates according to the user's answers
the Elo ratings converge into more or less stable values. 2*n^2 or
better 3*n^n is enough.
One could use it to sort a list of tasks by priority, for example, if
you struggle with deciding which one
is the highest priority. Or use it to scientifically prove that
oranges are better than apples!
It's fun - try it :)
> GLHF!
Thank you for useful advice, Emanuel!