Skip to main content
Article thumbnail
Location of Repository

Computational chunking in Chess

By Andrew James Cook


Adriaan de Groot, the Dutch psychologist and chess Master, argued that “perception and memory are more important differentiators of chess expertise than the ability to look ahead in selecting a chess move” (Groot 1978). A component of expertise in chess has been attributed to the expert having knowledge of ‘chunks’ and this knowledge gives the expert the ability to focus quickly on “good moves with only moderate look-ahead search” (Gobet and Simon 1998). The effects of chunking in chess are widely reported in the literature, however papers reporting the nature of chunks are largely based on inference from psychological experimentation. This thesis reports original work resulting from extensive data mining of a large number of chessboard configurations to explore the nature of chunks within the game of chess and the associated moves played by expert chess players. The research was informed by work in the psychology of chess and explored with software engineering techniques, employing large datasets consisting of transcripts from expert players games. The thesis reports results from an analysis of chunks throughout the game of chess, explores the properties of meaningful chunks and reports effects of the application of chunk knowledge to move searching

Topics: GV Recreation Leisure, QA75 Electronic computers. Computer science, QA76 Computer software
Year: 2011
OAI identifier:

Suggested articles


  1. (1896/1996) Psychologie des grands calculateurs et joururs d‟echecs.
  2. (1991). A Review of Inductive Learning,
  3. (1973). A Simulation for chess positions, doi
  4. (1997). AI as sport. doi
  5. (1975). An Analysis of the Alpha-Beta Pruning,
  6. (1991). Aspects of skilled imagery in blindfold chess. doi
  7. (1987). Chunking by a pigeon in a serial learning task, doi
  8. (2001). Chunking mechanisms in human learning,
  9. (2006). Chunking, rule learning, and multiple item memory in rat interleaved serial pattern learning , Learning and Motivation, Volume 37, Issue 2, doi
  10. (1984). EPAM-like models of recognition and learning", Cognitive Science, Volume 8, Issue 4, October-December doi
  11. (1998). Expert chess memory: Revisiting the chunking hypothesis.
  12. (2000). Five seconds or sixty? Presentation time in expert memory.
  13. (2001). High order chunking in serial pattern learning by rats in the T-maze”, doi
  14. (2002). In search of templates”,
  15. (1969). Information-processing analysis of perceptual. processes in problem solving. doi
  16. (1990). Learning Artificial Grammars with Competitive Chunking, doi
  17. (1994). Location coding in chess. Quarterly Journal of Experimental Saariluoma P. doi
  18. (2006). Long-term Learning in Soar and ACT-R.
  19. (1995). Long-term working memory. doi
  20. (2009). Natural language processing with Pytho, O'Reilly doi
  21. (1992). Pattern Based Tactical Planning, doi
  22. (1998). Pattern Recognition Makes Search Possible: Comments on Holding doi
  23. (1996). Perception and Memory in Chess, Studies in the Heuristics of the Professional Eye, Van Gorcum
  24. (1990). Programming a Computer for Playing Chess.
  25. (1996). Recall of random and distorted positions: Implications for the theory of expertise. doi
  26. (1996). Templates in chess memory: A mechanism for recalling several boards.
  27. (2010). The CHREST Architecture of Cognition: The Role of Perception in General Intelligence. Advances in Intelligent System Research,
  28. (1996). The roles of recognition processes and look-ahead search in timeconstrained expert problem solving: Evidence from grandmaster level chess.
  29. (1994). Towards a chess program based on a model of human memory”. In
  30. (1984). Using Chunking to solve chess pawn endgames”. doi
  31. (1998). Working memory and thinking. doi

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.