Cognitive Psychology
Find the tilted solid bar. When it is the only tilted thing on screen, the number of items barely matters. When half the tilted things are hollow, it matters a great deal.
Original geometric displays — illustrative browser timing, not laboratory measurement
By the end you should be able to read a search slope in milliseconds per item, and say what a flat slope and a steep one each imply about how the display was searched.
About 25 minutes. Nothing you do here is saved or sent anywhere.
"Parallel" and "serial" are theories, not observations. A flat slope is consistent with checking everything at once, and also with a very fast limited-capacity process. A steep slope is consistent with checking one item at a time, and also with a graded process that gets less efficient as competition grows. Slopes constrain accounts; they do not choose between them.
Browser timing is approximate. Display refresh, keyboard latency and background load add tens of milliseconds. Treat every number here as illustrative.
You will search for one target — a tilted solid bar — in two kinds of display. In the feature displays every other item is an upright solid bar, so the target is the only tilted thing there. In the conjunction displays half the other items are upright solid bars and half are tilted hollow bars. The target is the only item that is tilted and solid, and neither property alone picks it out.
Nothing here is timed. Build a display, look for the target, and reveal it when you are ready. Do this a few times at 32 items in each condition — the difference is obvious long before any reaction time is recorded.
The target is always a bar that is both tilted and solid. Every display is drawn fresh from a documented generator; positions are jittered on a grid so nothing sits in a predictable place.
A description of the display will appear here.
A display appears and stays until you answer. Press J if the tilted solid bar is there and F if it is not, or use the two buttons. Set size varies from trial to trial; half the trials have no target at all.
Four untimed practice trials with feedback, then a block of 18 scored trials — three set sizes, target present and absent, three trials of each. Results are withheld until the block ends so that seeing them cannot change how you search.
Status Not started.
Answer the question above to unlock the experiment.
| Items | Target | Trials | Correct | Mean RT |
|---|
| Items | Target | Trials | Correct | Mean RT |
|---|
| Condition | Target | Intercept | Slope | Trials used |
|---|
Five claims somebody might make on the basis of search functions like these. Decide, for each, whether data of this kind support it, contradict it, or simply do not reach it.
When the target differs from everything else in a single property, adding items costs very little. When the target is defined only by a combination of two properties, each of which it shares with some of the distractors, adding items costs a great deal. The same eyes, the same screen, the same instruction: what changed is how the target is specified.
A search function is a line: reaction time against number of items. Its slope, in milliseconds per item, is the quantity that distinguishes the two conditions, and it is far more informative than any single mean. A condition with a high intercept and a flat slope is doing something quite different from one with a low intercept and a steep slope, even if their average reaction times happen to match.
To say "yes" you can stop the moment you find the target. To say "no" you have to be satisfied that it is not there. If items were checked one at a time in a random order, a present trial would need about half the items on average and an absent trial all of them. That gives an absent slope about twice the present slope. Ratios near two are commonly observed. That is a striking fit, but it is not a proof: quitting rules, guessing and graded processing produce similar ratios.
The original two-stage account read a flat slope as unlimited parallel processing and a steep slope as an item-by-item scan. Both readings have been challenged for decades. Limited-capacity parallel models produce steep slopes without any scanning; signal detection accounts produce them from accumulating noise; and search efficiency turns out to vary continuously across tasks rather than falling into two types. The distinction is worth learning because it organises the findings, not because it settles them.