Skip to main content
. 2023 Apr 21;9(16):eadg3289. doi: 10.1126/sciadv.adg3289

Fig. 6. Summary of n-back task protocols.

Fig. 6.

Top (task 1): Binary classification of two 2 × 2 patterns (A and B; two nonzero inputs each) and n = 2. Middle (task 2): Binary classification of 3 × 3 patterns (five nonzero inputs) and varying n. Bottom (task 3): WM task using multiple randomly selected, nonrepeated 3 × 3 patterns (A to G; example sequence shown) and varying n. Characters in red represent target pattern tested in each task.