Serial and parallel search strategies are distinguished and illustrated. Investigators are urged to explore when and how these strategies are used and combined in normal search rather than to focus on which one is ''right''. Although serial search would be more efficient if there were a system for discouraging wasteful reinspections, we should not be embarrassed by the possibility that serial search may be amnesic. A critical review and meta-analysis of studies exploring whether visual search is amnesic leads to the conclusion that it probably rarely is. In contrast, there is ample evidence for the existence of inhibitory tags (inhibition of return) that might discourage reinspections during search. Three strategies for linking these tags to increased search efficiency are described.
SERIAL, PARALLEL, AND HYBRID SEARCH STRATEGIESMany everyday tasks involve searching through a set of items for a target. Broadly speaking, two classes of strategy have been distinguished: Serial and parallel. A serial search strategy involves sequential inspection of items in the set. In contrast, in a parallel strategy information about the ''targetness'' of each item in the set accumulates at the same time. Serial search can be self-terminating (a response is given once the target is found) or exhaustive (the set of items is inspected and then the response is given). If a serial search requires the same average inspection duration for items early as for items late in a search episode then the time to perform the target task (which might be to make a target present versus absent judgement; to indicate the location of the target; or to report some property of the target) will be a linear function of the number of items in the set. For this reason, among others, set size has become a ubiquitous independent variable in studies exploring search (Sternberg, 1970;Treisman & Gelade, 1980), and the slope of the linear function relating reaction time to set size (ms/item) is often used to generate an estimate of the inspection time per item. Under some conditions the time to find the target is unaffected by the number of items in the set. Such