3 ms·
That sounds fascinating. Is there anywhere you could look at the result (or code ;) of this work?
by mtrimpe 10y ago
That sounds fascinating. Is there anywhere you could look at the result (or code ;) of this work?
- mikekchar 10y agoUmm... The code is horrific as I was experimenting with a few different ideas. It is written in Ruby for GTK+ and is not at all idiomatic Ruby. It's also somewhere between slightly and completely broken at the moment... But with all that in mind: https://github.com/mikekchar/JLDrill https://github.com/mikekchar/JLDrill Probably more interesting is simply my description of the scheduling algorithm: https://github.com/mikekchar/JLDrill/blob/master/web/src/Strategy.page https://github.com/mikekchar/JLDrill/blob/master/web/src/Str... There is also one detail missing which is forgetting. Because the items are sorted by the ratio of time waited to "ideal schedule", we can easily stick anything over a certain amount into a separate set (called the forgotten set). That way if you don't study for a long time you can "forget" those items and they are treated like a high priority "new" set until the set is empty. Probably that makes no sense, but if you read my strategy document, you will hopefully be able to understand.