Desirable Difficulty

Desirable difficulties are learning conditions that make encoding harder in the short term but dramatically improve long-term retention. The term was coined by cognitive psychologist Robert Bjork in 1994. Examples include spacing practice over time instead of cramming, interleaving different topics instead of blocking them, and testing yourself instead of re-reading. These strategies feel harder in the moment, which is precisely why they work — the extra effort strengthens the memory trace.

The key insight is that not all difficulty is desirable. A desirable difficulty is one that triggers deeper processing without exceeding the learner's ability to succeed. If a challenge is so hard that you cannot retrieve the answer at all, the difficulty becomes undesirable and learning breaks down. This is why modern spaced repetition systems target a specific recall probability — typically around 70-90% — rather than making every review as hard as possible.

Revu's FSRS algorithm is designed around this principle. By targeting a retention rate that keeps reviews challenging but achievable, the scheduler ensures each study session operates in the zone of desirable difficulty. Cards are shown just as they are about to be forgotten, forcing genuine recall effort. Combined with interleaving across topics and active recall on every card, the entire system is built to maximise the desirable difficulty effect.