Working-memory updating under pressure: hit when the current letter matches the one two steps earlier — simple rule, tough control.
← Back to homeMeasures selective updating and interference control: you maintain a sliding window of two items and decide whether the new one matches the earlier pattern.
Examples: A → B → A = match; C → D → C = match; D → E → F → F = no match (that’s 1-back, not 2-back).
Each correct (hit or correct rejection) = 1 point. Final score (0–100) blends points with a speed factor from the mean RT of hits.
It probes your ability to continuously update a small buffer while suppressing interference from recent but irrelevant items. That’s key for reading span, multi-step instructions, and complex problem solving.