MITECS: Chess, Psychology of

Similar documents
The Roles of Recognition Processes and Look-Ahead Search in Time-Constrained Expert Problem Solving: Evidence from Grandmaster Level Chess

A computer model of chess memory 1

Expert memory: a comparison of four theories

The Effects of Speed on Skilled Chess Performance. Bruce D. Burns. Michigan State University

Dynamic perception in chess

ABSTRACT. Chess Performance under Time Pressure: Evidence for the Slow Processes in Speed Chess. Yu-Hsuan Chang

Effect of expertise acquisition on strategic perception: The example of chess

Expertise Effects in Memory Recall: a Reply to Vicente and Wang

Expertise in Complex Decision Making: The Role of Search in Chess 70 Years After de Groot

The Use of Memory and Causal Chunking in the Game of Shogi

Chess Beyond the Rules

Computational Modelling of Mental Imagery in Chess: A Sensitivity Analysis

Recall of rapidly presented random chess positions is a function of skill

Expert Chess Memory: Revisiting the Chunking Hypothesis

Running head: MENTAL IMAGERY AND CHUNKS. Mental Imagery and Chunks: Empirical and Computational Findings. Andrew J. Waters

The perceptual aspect of skilled performance in chess: Evidence from eye movements

Recall of random and distorted chess positions: Implications for the theory of expertise

Specialization Effect and Its Influence on Memory and Problem Solving in Expert Chess Players

Role of presentation time in Recall of Game and Random Chess Positions

UC Merced Proceedings of the Annual Meeting of the Cognitive Science Society

Computational Chunking in Chess

Perception in chess: Evidence from eye movements

Data mining of chess chunks: a novel distance-based structure

Computer Science Research Review

An Experiment in Students Acquisition of Problem Solving Skill from Goal-Oriented Instructions

Running Head: EXPERTISE VS. TALENT. Expertise vs. Talent. Fernand Gobet. Centre for the Study of Expertise. Brunel University

Reaching for Excellence in Interpreting: Suggestions from Studies of Chess Masters, Musicians, Athletes, and Doctors

Visual Search in Ecological and Non-Ecological Displays: Evidence for a Non-Monotonic Effect of Complexity on Performance

Search, Recognition, and Visualization in Chess: Rebuttal to Gobet s Critique of Chabris & Hearst (2003)

Recall or evaluation of chess positions as determinants of chess skill

The essential role of. mental models in HCI: Card, Moran and Newell

Bibliography Alien Newell

Introduction to Humans in HCI

Using Neural Network and Monte-Carlo Tree Search to Play the Game TEN

Chess Skill in Man and Machine

UNIT 13A AI: Games & Search Strategies

Artificial Intelligence. Shobhanjana Kalita Dept. of Computer Science & Engineering Tezpur University

Game-playing Programs. Game trees

Creating a Poker Playing Program Using Evolutionary Computation

Computer Go: from the Beginnings to AlphaGo. Martin Müller, University of Alberta

Using the Time Based Resource Sharing model

STRATEGO EXPERT SYSTEM SHELL

April 25, Competing and cooperating with AI. Pantelis P. Analytis. Human behavior in Chess. Competing with AI. Cooperative machines?

Chapter 7 Information Redux

An Introduction to Poker Opponent Modeling

Algorithms for Selective Search. Bouke van der Spoel

Recently, a winning opening for the game of Dakon was found by hand. This

John S. Gero and Udo Kannengiesser, Key Centre of Design Computing and Cognition, University of Sydney, Sydney, NSW 2006, Australia

Acquiring and Using Knowledge in Computer Chess. Tristan Caulfield BSc (Hons) Computer Science University of Bath

Artificial Intelligence Search III

Recall ofrandom and distorted chess positions: Implications for the theory ofexpertise

A Balanced Introduction to Computer Science, 3/E

Lecture 1 What is AI?

Chase, W. G., & Simon, H. A. (1973). Perception in chess. Cognitive Psychology, 4,

Adversarial Search. CS 486/686: Introduction to Artificial Intelligence

Goals of this Course. CSE 473 Artificial Intelligence. AI as Science. AI as Engineering. Dieter Fox Colin Zheng

A complete database of international chess players and chess performance ratings for varied longitudinal studies

What is Artificial Intelligence? Alternate Definitions (Russell + Norvig) Human intelligence

Sex Differences in Intellectual Performance Analysis of a Large Cohort of Competitive Chess Players

APILOT attempts to land in marginal conditions. Multiple

Ce cours: Introduction

AI in Business Enterprises

PSY200 Cognitive Psychology 1

Outline. Game Playing. Game Problems. Game Problems. Types of games Playing a perfect game. Playing an imperfect game

Towards Strategic Kriegspiel Play with Opponent Modeling

Chapter 1: Introduction to Neuro-Fuzzy (NF) and Soft Computing (SC)

Running head: THINKING AND PROBLEM SOLVING IN CHESS. Thinking and Problem Solving in Chess: The Development of a Prototypical Model to Account

LONDON S BEST BUSINESS MINDS TO COMPETE FOR PRESTIGIOUS CHESS TITLE

From Model to Application: Developing a believable opponent in the game of Set!

Data mining, Bongard problems, and the concept of pattern conception

The game of Reversi was invented around 1880 by two. Englishmen, Lewis Waterman and John W. Mollett. It later became

Adversarial Search. CS 486/686: Introduction to Artificial Intelligence

UNIT 13A AI: Games & Search Strategies. Announcements

ARTICLE IN PRESS. Intelligence xx (2006) xxx xxx. Received 7 June 2006; received in revised form 19 September 2006; accepted 20 September 2006

CSC384 Intro to Artificial Intelligence* *The following slides are based on Fahiem Bacchus course lecture notes.

Computer Science as a Discipline

Human Play for the Development of Expertise. Susan L. Epstein

Mathematics has a bad reputation. implies that. teaching and learning should be somehow related with the psychological situation of the learner

ARTIFICIAL INTELLIGENCE IN POWER SYSTEMS

Effective Iconography....convey ideas without words; attract attention...

No stereotype threat effect in international chess

Virtual Model Validation for Economics

Studies of the mental processes of chess grandmasters have revealed clues to how people become experts in other fields as well By Philip E.

CMSC 372 Artificial Intelligence. Fall Administrivia

The Behavior Evolving Model and Application of Virtual Robots

Game Playing: The Next Moves

Information at Early Design Stages

The Mechanisms and Boundary Conditions of the Einstellung Effect in Chess: Evidence from Eye Movements

A CHESS OPENING REPERTOIRE FOR BLITZ & RAPID: SHARP, SURPRISING AND FORCING LINES FOR BLACK AND WHITE BY EVGENY SVESHNIKOV, VLADIMIR SVES

Chess and Intelligence: Lessons for Scholastic Chess

Outline. What is AI? A brief history of AI State of the art

Artificial Intelligence: An overview

Educational benefits of chess instruction: A critical review

Lecture 1 What is AI? EECS 348 Intro to Artificial Intelligence Doug Downey

TIES: An Engineering Design Methodology and System

TD-Gammon, a Self-Teaching Backgammon Program, Achieves Master-Level Play

V. Adamchik Data Structures. Game Trees. Lecture 1. Apr. 05, Plan: 1. Introduction. 2. Game of NIM. 3. Minimax

arxiv: v2 [cs.lg] 7 May 2017

LONDON S BEST BUSINESS MINDS TO COMPETE FOR PRESTIGIOUS CHESS TITLE

Comparative Power Of The Independent t, Permutation t, and WilcoxonTests

Transcription:

Page 1 of 5 Historically, chess has been one of the leading fields in the study of EXPERTISE (see De Groot and Gobet 1996 and Holding 1985 for reviews). This popularity as a research domain is explained by the advantages that chess offers for studying cognitive processes: (i) well-defined task; (ii) presence of a quantitative scale to rank chess players (Elo 1978); (iii) cross-fertilization with research on game-playing in computer science and artificial intelligence. Many of the key chess concepts and mechanisms to be later developed in cognitive psychology were anticipated by Adriaan De Groot's (1946/1978) book Thought and Choice in Chess. De Groot stressed the role of selective search, perception, and knowledge in expert chess playing. He also perfected two techniques that were to be often used in later research: recall of briefly-presented material from the domain of expertise, and use of thinking-aloud protocols to study problem-solving behavior. His key empirical findings were that (i) world-class chess grandmasters do not search more, in number of positions considered and in depth of search, than weaker (but still expert) players; and (ii) grandmasters and masters can recall positions (about two dozen pieces) presented for a few seconds almost perfectly, while weaker players can replace only a half dozen pieces. De Groot's theoretical ideas, based on Otto Selz's psychology, were not as influential as his empirical techniques and results. It was only about 25 years later that chess research would produce a theory with a strong impact on the study of expertise and of cognitive psychology in general. In their chunking theory, Simon and Chase (1973) stressed the role of perception in skilled behavior, as did De Groot, but they added a set of elegant mechanisms. Their key idea was that expertise in chess requires acquiring a large collection of relatively small chunks (each at most 6 pieces) denoting typical patterns of pieces on the chess board. These chunks are accessed through a discrimination net and act as the conditions of a PRODUCTION SYSTEM: they evoke possible moves in this situation. In other respects, chess experts do not differ from less expert players: they have the same limits in memory (a shortterm memory of about 7 chunks) and learning rate (about 8 seconds are required to learn a chunk). In chess, as well as in other domains, the chunking theory explains experts' remarkable memory by their ability to find more and larger chunks, and explains their selective search by the fact that chunks evoke potentially good actions. Some aspects of the theory were implemented in a computer program by Simon and Gilmartin (1973). Simulations with this program gave a good fit to the behavior of a strong amateur and led to the estimation that expertise requires the presence of a large number of chunks, approximately between 10,000 and 100,000. A wealth of empirical data were gathered to test the chunking theory in various domains

Page 2 of 5 of expertise. In chess, five directions of research may be singled out as critical: importance of perception and pattern recognition, relative role of short-term and long-term memories, evidence for chunks, role of higher-level knowledge, and size of search. Converging evidence indicates that perceptual, pattern-based cognition is critical in chess expertise. The most compelling data are that EYE MOVEMENTS during the first few seconds when examining a new chess position differ between experts and non-masters (De Groot and Gobet 1996), and that masters still play at a high level in speed chess games where they have only five seconds per move on average, or in simultaneous games where their thinking time is reduced by the presence of several opponents (Gobet and Simon 1996). Research on MEMORY has led to apparently contradictory conclusions. On the one hand, several experiments on the effect of interfering tasks (e.g., Charness 1976) have shown that two of Simon and Chase's (1973) assumptions -- that storage into long-term memory is slow and that chunks are held in short-term memory -- run into problems. This encouraged researchers such as Cooke et al. (1993) to emphasize the role of higher-level knowledge, already anticipated by De Groot (1946/1978). On the other hand, empirical evidence for chunks has also been mounting (e.g., Chi 1978; Gobet and Simon 1996; Saariluoma 1994). Attempts to reconcile low-level and high-level types of encoding have recently been provided by the long-term WORKING MEMORY (LTWM) theory (Ericsson and Kintsch 1995) and by the template theory (Gobet and Simon 1996). LTWM proposes that experts build up both schema-based knowledge and domain-specific retrieval structures that encode the important elements of a problem rapidly. The template theory, based on the chunking theory and implemented as a computer program, proposes that chunks evolve into more complex data structures (templates), allowing some values to be encoded rapidly. Both theories also account for aspects of skilled perception and problem solving in chess. Recent results indicate that stronger players search somewhat more broadly and deeply than weaker players (Charness 1981; Holding 1985), with an asymptote at high skill levels. In addition, the space searched remains small (thinking-aloud protocols indicate that grandmasters typically search no more than one hundred nodes in 15 minutes). These results are compatible with a theory based on pattern-recognition: chunks, which evoke moves or sequences of moves, both make search more selective and allow better players to search more deeply. While productive in its own terms, computer science research on chess (see GAME- PLAYING SYSTEMS) has had relatively little impact on the psychology of chess. The main advances have been the development of search techniques, which have culminated in the construction of DEEP BLUE, the first computer to have beaten a world champion in a match. More recently, chess has been a popular domain for testing MACHINE LEARNING techniques. Finally, attempts to use a production-system architecture (e.g., Wilkins 1980) have met with limited success in terms of the strength of the programs. The key findings in chess research -- selective search, pattern recognition, and memory for the domain material -- have been shown to generalize to other domains of expertise. This augurs well for current interests in the field: integration of low- and high-level aspects of knowledge and unification of chess perception, memory, and problem solving theories into a single theoretical framework. See also

Page 3 of 5 COGNITIVE ARCHITECTURE DOMAIN SPECIFICITY HEURISTIC SEARCH PROBLEM SOLVING -- Fernand Gobet REFERENCES Charness, N. (1976). Memory for chess positions: resistance to interference. Journal of Experimental Psychology: Human Learning and Memory 2: 641-653. Charness, N. (1981). Search in chess: age and skill differences. Journal of Experimental Psychology: Human Perception and Performance 2: 467-476. Chi, M. T. H. (1978). Knowledge structures and memory development. In R. S. Siegler (Ed.), Children's Thinking: What Develops? Hillsdale, NJ: Erlbaum, pp. 73-96. Cooke, N. J., R. S. Atlas, D. M. Lane and R. C. Berger. (1993). Role of high-level knowledge in memory for chess positions. American Journal of Psychology 106: 321-351. de Groot, A. D. (1978). Thought and Choice in Chess. The Hague: Mouton Publishers. (First edition in Dutch, 1946). de Groot, A. D. and F. Gobet. (1996). Perception and memory in chess. Heuristics of the professional eye. Assen: Van Gorcum. Ericsson, K. A. and W. Kintsch. (1995). Long-term working memory. Psychological Review 102: 211-245. Gobet, F. and H. A. Simon. (1996). Templates in chess memory: a mechanism for recalling several boards. Cognitive Psychology 31:1-40. Holding, D. H. (1985). The Psychology of Chess Skill. Hillsdale, NJ: Erlbaum. Saariluoma, P. (1994). Location coding in chess. The Quarterly Journal of Experimental Psychology 47A: 607-630. Simon, H. A. and W. G. Chase. (1973). Skill in chess. American Scientist 61: 393-403. Simon, H. A. and K. J. Gilmartin. (1973). A simulation of memory for chess positions. Cognitive Psychology 5:29-46.

Page 4 of 5 Wilkins, D. (1980). Using patterns and plans in chess. Artificial Intelligence 14: 165-203. Further Readings Binet, A. (1966). Mnemonic virtuosity: a study of chess players. Genetic Psychology Monographs 74: 127-162. (Translated fom the Revue des Deux Mondes (1893) 117: 826-859.) Calderwood, B., G. A. Klein, and B. W. Crandall. (1988). Time pressure, skill, and move quality in chess. American Journal of Psychology 101: 481-493. Charness, N. (1989). Expertise in chess and bridge. In D. Klahr and K. Kotovsky (Eds.), Complex Information Processing, the Impact of Herbert A. Simon. Hillsdale, NJ: Erlbaum, pp. 183-208. Chase, W. G. and H. A. Simon. (1973). Perception in chess. Cognitive Psychology 4: 55-81. Elo, A. (1978). The Rating of Chess Players, Past and Present. New York: Arco. Frey, P. W. and P. Adesman. (1976). Recall memory for visually presented chess positions. Memory and Cognition 4: 541-547. Freyhoff, H., H. Gruber, and A. Ziegler. (1992). Expertise and hierarchical knowledge representation in chess. Psychological Research 54: 32-37. Fürnkranz, J. (1996). Machine learning in computer chess: the next generation. International Computer Chess Association Journal 19: 147-161. Gobet, F. and H. A. Simon. (1996a). The roles of recognition processes and lookahead search in time-constrained expert problem solving: Evidence from grandmaster level chess. Psychological Science 7: 52-55. Gobet, F. and H. A. Simon. (1996b). Recall of rapidly presented random chess positions is a function of skill. Psychonomic Bulletin and Review 3: 159-163. Goldin, S. E. (1978). Effects of orienting tasks on recognition of chess positions. American Journal of Psychology 91: 659-671. Hartston, W. R. and P. C. Wason. (1983). The Psychology of Chess. London: Batsford. Newell, A. and H. A. Simon. (1972). Human Problem Solving. Englewood Cliffs, NJ: Prentice-Hall. Pitrat, J. (1977). A chess combinations program which uses plans. Artificial

Page 5 of 5 Intelligence 8: 275-321. Robbins, T. W., E. Anderson, D. R. Barker, A. C. Bradley, C. Fearnyhough, R. Henson, S. R. Hudson and A. D. Baddeley, (1995). Working memory in chess. Memory and Cognition 24: 83-93. Simon, H. A. (1979). Models of Thought, Vol. 1. New Haven: Yale University Press. Simon, H. A. and M. Barenfeld. (1969). Information processing analysis of perceptual processes in problem solving. Psychological Review 76: 473-483.