Ordering Request: Reverse Relative Overdueness

Well, let’s try our luck
@dae Recommend sorting by relative overdueness.md by Expertium · Pull Request #634 · open-spaced-repetition/fsrs4anki · GitHub

According to Jarrett’s simulations, the following sort orders are the worst for dealing with a backlog:

  1. Due Date Ascending
  2. Difficulty Descending
  3. Add Order Ascending

Let’s remove them and add Retrievability Descending aka Reverse Relative Overdueness instead. It will be a net decrease in the number of sort orders meaning a net decrease in the amount of confusion, and the new sort order is more useful than those.

EDIT: an even more radical solution, only keep these:

  1. Difficulty Ascending
  2. Retrievability Descending (Reverse Relative Overdueness)
  3. Add Order Descending
  4. Interval Ascending
  5. Retrievability Ascending (Relative Overdueness)

And remove the rest. These are the best for handling backlogs. Right now there are 11 (!!!) different sort orders. This is extremely beginner-unfriendly.

Also, see this: Ordering Request: Reverse Relative Overdueness - #86 by rich70521

EDIT: there are too many comments here, I made a clean post: Improving sort orders

4 Likes