A pattern-recognition theory of search in expert problem solving

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 "mind's 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

Generating Levels That Teach Mechanics

The automatic generation of game tutorials is a challenging AI problem. While it is possible to generate annotations and instructions that explain to the player how the game is played, this paper focuses on generating a gameplay experience that introduces the player to a game mechanic. It evolves small levels for the Mario AI Framework that can only be beaten by an agent that knows how to perform specific actions in the game. It uses variations of a perfect A* agent that are limited in various ways, such as not being able to jump high or see enemies, to test how failing to do certain actions can stop the player from beating the level.Comment: 8 pages, 7 figures, PCG Workshop at FDG 2018, 9th International Workshop on Procedural Content Generation (PCG2018

Expertise in chess

This chapter provides an overview of research into chess expertise. After an historical background and a brief description of the game and the rating system, it discusses the information processes enabling players to choose good moves, and in particular the trade-offs between knowledge and search. Other topics include blindfold chess, talent, and the role of deliberate practice and tournament experience

Checking chess checks with chunks: A model of simple check detection

The procedure by which humans identify checks in check positions is not well understood. We report here our experience in modelling this process with CHREST, a general-purpose cognitive model that has previously successfully captured a variety of attention- and perception-related phenomena. We have attempted to reproduce the results of an experiment investigating the ability of humans to determine checks in simple chess positions. We propose a specific model of how humans perform this experiment, and show that, given certain reasonable assumptions, CHREST can follow this model to create a good reproduction of the data

Towards an alternative to Benner’s theory of expert intuition in nursing: A discussion paper

Several authors have highlighted the role of intuition in expertise. In particular, a large amount of data has been collected about intuition in expert nursing, and intuition plays an important role in the influential theory of nursing expertise developed by Benner (1984). We discuss this theory, and highlight both data that support it and data that challenge it. Based on this assessment, we propose a new theory of nursing expertise and intuition, which emphasizes how perception and conscious problem solving are intimately related. In the discussion, we propose that this theory opens new avenues of enquiry for research into nursing expertise

Mechanical Generation of Heuristics for Intractable Theories

A domain independent mechanism for generating heuristics for intractable theories has been implemented in the POLLYANNA program. Heuristics are generated by a process of systematically applying generic simplifying assumptions to an initial intractable theory. Such assumptions sacrifice the accuracy of an intractable theory to gain efficiency in return. Truth preserving reformulations are also used to enhance the power of generic simplifying assumptions. This paper describes a framework for generating heuristics using these basic types of knowledge. Examples and representations of each are presented along with an architecture within which they interact to generate heuristic theories. Results from testing this technique in the hearts card domain are presented as well. This work is pan of a system combining analytic and empirical methods for learning heuristics. In the analytic phase, a set of candidate heuristics is generated from an intractable theory. In the empirical phase, heuristic theories are evaluated against teacher-provided training examples. This paper concentrates on the analytic process of generating heuristics

Expertise effects in memory recall: A reply to Vicente and Wang

This article may not exactly replicate the final version published in the APA journal. It is not the copy of record.In the January 1998 Psychological Review, Vicente and Wang propose a "constraint attunement hypothesis" to explain the large effects of domain expertise upon memory recall observed in a number of task domains. They claim to find serious defects in alternative explanations of these effects which their theory overcomes. Re-examination of the evidence shows that their theory is not novel, but has been anticipated by those they criticize, and that other current published theories of the phenomena do not have the defects Vicente and Wang attribute to them. Vicente and Wang's views reflect underlying differences (a) about emphasis upon performance versus process in psychology, and (b) about how theories and empirical knowledge interact and progress with the development of a science