Perceptual automaticity in expert chess players: Parallel encoding of chess relations

A check detection task in a 5 × 5 section of the chessboard, containing a King and one or two potential checking pieces was employed. The checking status (i.e., the presence or absence of a check) and the number of attackers (one or two) were manipulated. It was found that the reaction time cost for adding a distractor was differentially greater inno trials thanyes trials for novice, but not for expert, chess players. In addition, we contrasted standard check detection trials with trials in which one of two attackers was cued (colored red) and the task was to determine the checking status of the cued attacker while ignoring the other attacker. We documented a Stroop-like interference effect on trials in which a cued nonchecking attacker appeared together with an attacker that was checking (i.e., incongruent). These findings suggest automatic and parallel encoding procedures for chess relations in experts.     

Recall or evaluation of chess positions revisited: the relationship between memory and evaluation in chess skill

We extend work by Holding and Reynolds (1982) on recall and problem solving with quasirandom chess positions. We tested 17 chess players on both quasirandom and structured chess positions. Consistent with the earlier study, initial recall of quasirandom chess positions is unrelated to chess skill level, and quality of the move selected in subsequent problem solving is related to skill level. However, recall following problem solving is related to chess skill level. These results support the view that pattern recognition processes underlie superior performance by skilled chess players, contrary to the conclusions of Holding and Reynolds (1982). Mechanisms such as long-term working memory retrieval structures (Ericsson & Kintsch, 1995) or templates (Gobet & Simon, 1996a) could explain the effective encoding of quasirandom positions during problem solving.