What does The 85% Rule and Deliberate Practice conclude, in numbers, about “Interleaved versus Blocked: Desirable Difficulties”?
Answer: Bjork's "desirable difficulties" distinguish performance in practice from long-term learning. In Rohrer and Taylor's small experiment, blocked practice scored 89 % against 60 % for interleaving during practice, but 20 % against 63 % a week later. A meta-analysis finds an overall interleaving effect of g = 0.42, varying with the material: largest for paintings, moderate for mathematics, and with blocking better for words; the more similar the categories, the more interleaving helps. A cue-competition model shows that the interleaving effect appears in error-driven learners but not in an ideal Bayesian learner. The next chapter turns to another element of practice: the timing and grain of feedback.
Scope of the numbers: Marked boxes separate evidence, runnable Python calculations (15 programs), classical sources and the author's hypotheses.
Data table
The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python onlyprinted values that match the answer: 63
| 400 simulated learners per cell; P = practice accuracy, T = test accuracy; | |
| B = blocked, M = mixed (interleaved) practice | |
| shared | ideal Bayes B: P / T M: P / T | error-driven B: P / T M: P / T | |
| 0/12 | | 92% / 93% 88% / 93% | 90% / 90% 84% / 91% |
| 4/12 | | 84% / 86% 80% / 86% | 84% / 77% 74% / 82% |
| 8/12 | | 68% / 70% 63% / 69% | 79% / 52% 56% / 65% |
Show the full program
# Blocked vs interleaved (author's model, illustrative). 4 types x 12-feature prototypes, 15 %
# flips; "shared" features make types alike. Surface cue = previous problem's type. Ideal Bayes
# (naive Bayes) vs error-driven delta rule where cues compete. 64 practice, 40 test problems.
import math, random
K, T, FLIP, ETA = 12, 4, 0.15, 0.25
def prototypes(shared, rng):
base = [rng.randint(0, 1) for _ in range(K)]
return [[b ^ (j >= shared and (j - shared) % T == k) for j, b in enumerate(base)]
for k in range(T)]
def problem(protos, k, rng):
return [b ^ (rng.random() < FLIP) for b in protos[k]]
def softmax(z):
m = max(z)
e = [math.exp(v - m) for v in z]
return [v / sum(e) for v in e]
def bayes_probs(counts, x):
return softmax([sum(math.log((c[j] + 1) / (n + 2) if b else 1 - (c[j] + 1) / (n + 2))
for j, b in enumerate(x)) for n, c in counts])
def inputs(prev, x):
return [1.0 if prev == k else 0.0 for k in range(T)] + [1.0 if b else -1.0 for b in x]
def session(order, protos, rng, learner, train=True):
hits, prev = 0, None
for k in order:
x = problem(protos, k, rng)
if learner["kind"] == "bayes":
p = bayes_probs(learner["counts"], x)
else:
u = inputs(prev, x)
p = softmax([sum(w * v for w, v in zip(W, u)) for W in learner["W"]])
hits += max(range(T), key=lambda j: p[j]) == k
if train and learner["kind"] == "bayes":
n, c = learner["counts"][k]
learner["counts"][k] = (n + 1, [cj + b for cj, b in zip(c, x)])
elif train:
for j in range(T):
err = (j == k) - p[j]
learner["W"][j] = [w + ETA * err * v for w, v in zip(learner["W"][j], u)]
prev = k
return hits / len(order)
def run(blocked, shared, seed):
rng = random.Random(seed)
protos = prototypes(shared, rng)
order = [k for k in range(T) for _ in range(8)] * 2
if not blocked:
rng.shuffle(order)
test = [rng.randrange(T) for _ in range(40)]
out = []
for kind in ("bayes", "delta"):
L = {"kind": kind, "counts": [(0, [0] * K) for _ in range(T)],
"W": [[0.0] * (T + K) for _ in range(T)]}
out += [session(order, protos, rng, L), session(test, protos, rng, L, train=False)]
return out
if __name__ == "__main__":
print("400 simulated learners per cell; P = practice accuracy, T = test accuracy;")
print("B = blocked, M = mixed (interleaved) practice")
print("shared | ideal Bayes B: P / T M: P / T | error-driven B: P / T M: P / T")
for shared in (0, 4, 8):
res = {b: [0.0] * 4 for b in (True, False)}
for s in range(400):
for b in (True, False):
res[b] = [a + v / 400 for a, v in zip(res[b], run(b, shared, s))]
B, M = res[True], res[False]
print(f"{shared:2d}/12 | {B[0]:4.0%} / {B[1]:4.0%} {M[0]:4.0%} / "
f"{M[1]:4.0%} | {B[2]:4.0%} / {B[3]:4.0%} {M[2]:4.0%} / {M[3]:4.0%}")Single source and citation
Fan, Y. (2026). The 85% Rule for Optimal Learning, Myelination Kinetics and Deliberate Practice (Version 1.0.0), Chapter 5: Interleaved versus Blocked: Desirable Difficulties. 5D Library. https://doi.org/10.5281/zenodo.23761339
DOI: 10.5281/zenodo.23761339 · Read the monograph · 5DL-B-023 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026023,
author = {Fan, Yafu},
title = {The 85% Rule for Optimal Learning, Myelination Kinetics and Deliberate Practice},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
doi = {10.5281/zenodo.23761339},
url = {https://doi.org/10.5281/zenodo.23761339}
}Other chapter answers in this book
- Chapter 1 · Too Easy to Learn, Too Hard to Cope: The 85 % Rule
- Chapter 2 · Deliberate Practice and "10,000 Hours"
- Chapter 3 · Hebbian Plasticity, Long-Term Potentiation and Activity-Dependent Myelination
- Chapter 4 · Forgetting Curves, the Spacing Effect and Retrieval Practice
- Chapter 6 · The Timing and Grain of Feedback
- Chapter 8 · Practice and a Pre-Registered Trial