Skip to main content
eScholarship
Open Access Publications from the University of California

Processing Constraints and Problem Difficulty: A Model

Abstract

In this paper we examine the role played by working memory demands in determining problem difficulty during the solution of Tower of Hanoi Problem isomorphs. W e do so by describing a production system model that accounts for subjects' performance on these problems via a dynamic analysis of the memory k>ad imposed by the problem and of changes in that load during the problem solving episode. W e also present the results of detailed testing of the model against human subject data. The model uses a highly constrained working memory to account for a number of features of the problem solving behavior, including the dichotomous (exploratory and final path) nature of the problem solving, the relative difficulty of the problems, the particular moves made in each state of the problem space, and the temporal patterning of the final path moves.

Main Content
For improved accessibility of PDF content, download the file to your device.
Current View