A pattern-recognition theory of search in expert problem solving

Thinking and Reasoning 3 (4):291 – 313 (1997)
Abstract Understanding how look-ahead search and pattern recognition interact is one of the important research questions in the study of expert problem solving. This paper examines the implications of the template theory Gobet & Simon, 1996a , a recent theory of expert memory, on the theory of problem solving in chess. Templates are chunks Chase & Simon, 1973 that have evolved into more complex data structures and that possess slots allowing values to be encoded rapidly. Templates may facilitate search in three ways: a by allowing information to be stored into LTM rapidly; b by allowing a search in the template space in addition to a search in the move space; and c by compensating loss in the minds eye due to interference and decay. A computer model implementing the main ideas of the theory is presented, and simulations of its search behaviour are discussed. The template theory accounts for the slight skill difference in average depth of search found in chess players, as well as for other empirical data.
Keywords No keywords specified (fix it)
Categories No categories specified (fix it)
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
 
Download options
PhilPapers Archive


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 5,875
External links
  • Through your library Configure

    Similar books and articles

    Analytics

    Monthly downloads

    Added to index

    2009-02-11

    Total downloads

    14 ( #84,232 of 556,840 )

    Recent downloads (6 months)

    0

    How can I increase my downloads?


    My notes
    Sign in to use this feature


    Discussion
    Start a new thread
    Order:
    There  are no threads in this forum
    Nothing in this forum yet.

    Other forums