الگوریتم به کار رفته در نرم افزار جعبه لایتنر
نکته ای کوتاه اما جالب در مورد نرم افزار supermemo از قوی ترین نرم افزارهای جعبه لایتنر و الگوریتم های بکار رفته در آن
Algorithms
The specific algorithm SuperMemo uses has been published, and re-implemented in other, non-commercial programs such as Anki and Mnemosyne among others.
Different algorithms have been used; SM-0 refers to the original (non-computer-based) algorithm, while SM-2 refers to the original computer-based algorithm (used in SuperMemo versions 1.0 through 3.0, referred to as SM-2 because SuperMemo version 2 was the most popular of these).[1] Subsequent versions of the software have further optimized the algorithm.
The SM-2 algorithm has proven most popular in other applications, and is used (in modified form) in Anki and Mnemosyne, among others. The SM-2 algorithm uses the performance on a card to schedule only that card, while SM-3 and higher algorithms use card performance to schedule that card and similar cards. The additional optimizations sometimes yield perverse results – answering "hard" on a card may yield an interval longer than answering "easy" on a card – and are criticized as reducing the robustness of the algorithm, making it more sensitive to variations – non-uniform difficulty of cards, inconsistencies in studying, and so forth.[2]
محمد روشندل پور