match
q: does each = its previous? (the N-back operation)
min stim: 1
max stim: 4
match all
q: are all of these = their previous? (all stimuli either are or are not matching)
min stim: 2
max stim: 4
inequality
q: is each >, <, or = its previous?
min stim: 1
max stim: 2
inequality all
q: are all of these >, <, or = their previous? (all stimuli move in the same direction)
min stim: 2
max stim: 4
inequality most
q: are most of these >, <, or = their previous? (2/3 or 3/4, at minimum, move in the same direction)
min stim: 3
max stim: 4
one match
q: of these, exactly which one = its previous? (the others will not =)
min stim: 2
max stim: 4
one mismatch
q: of these, exactly which one is not = its previous? (the others =)
min stim: 3
max stim: 4
one (mis)match
q: of these, exactly which one stands out, being the only match or only mismatch?
min stim: 3
max stim: 4
types
Software is nifty for re-use. For each of the above modes, minus the inequality ones, we add a clone, but these clones don't change the value of the stimuli (1 vs 3; a vs e), but rather change the type of the stimuli (1 vs e; a vs 3).
So...
- 1 and 3 match by type.
- 1 and e do not.
- e and a match by type.
- 3 and a do not.
...giving us...
- match type
- match type all
- one type match
- one type mismatch
- one type (mis)match
