rating-

Palm上著名的背单词软件的源码

SugarMemo Rating算法

变量说明:
Bn, 第N次按钮选择, Bn = Fail/Pass/Bingo
{noRating, Bingo, Pass, Fail} = {0, 1, 2, 3)
我倾向于
{noRating, Fail, Pass, Bingo} = {0, 1, 2, 3)

ts.1, ts.firstRating 的简写, ts.1 = Fail/Pass/Bingo
ts.2, ts.secondRating 的简写, ts.2 = Fail/Pass/Bingo
ts.1 记录复习的第一次Bn
ts.2 记录复习的第一次之后的Bn中最小的一次

现有规则, Bn = Pass/Bingo, 则退出复习, 同时进行 Rating
由于复习可以选模式,使得Rating的判断相对复杂, 并且还有多选模式

考虑最简单的情况, 只有一种复习, 比如说回想释义
这种情况下 Bn = Pass/Bingo 的时候, 就只有 ts.1, 不会有 ts.2
这时, 现有的Rating模式实际上只可能Rating成 B,C
这应该来说不太合理

我来说说我的想法, 应该主要依据 ts.1 来判断
ts.1 = Bingo, Rate = A
ts.1 = Pass,  Rate = B

totalFail = 1
ts.1 = Fail, ts.2 = Bingo, Rate = B
ts.1 = Fail, ts.2 = Pass,  Rate = C

totalFail = 2
ts.1 = Fail, ts.2 = Bingo, Rate = C
ts.1 = Fail, ts.2 = Pass,  Rate = D

totalFail > 2 and totalFail < MAXFAIL
ts.1 = Fail, ts.2 = Bingo, Rate = D
ts.1 = Fail, ts.2 = Pass,  Rate = E

totalFail >= MAXFAIL
ts.1 = Fail, ts.2 = Bingo, Rate = F
ts.1 = Fail, ts.2 = Pass,  Rate = F

再考虑稍微复杂一点的情况, 回想释义