Answers are grounded in this paper and cite their sources.
Representational Change Theory has proposed two processes, constraint relaxation (CR) and chunk decomposition (CD), that are responsible for restructuring during insight problem solving (Knoblich et al., Citation1999). If these processes are independent (Öllinger et al., Citation2008), then improvements in matchstick arithmetic performance due to instructions that prompt either process should be limited to problems that require that process. In Study 1, CD instructions only improved performance on CD problems while CR instructions only improved performance on CR problems. A combined instruction condition did not outperform the single instruction conditions, and in some cases decreased solution rates. Study 2 varied whether solutions directly matched the instructions and found some evidence that CD instructions generalised to CD solutions that did not directly match instructions. However, CR instructions did not increase solutions on CR problems, and single instructions sometimes decreased solutions on problems requiring another process. Although these results are most consistent with hypotheses that these processes are independent and competitive in the context of matchstick arithmetic problems, issues with the specificity of the hints used in the instructional conditions are discussed.
No takes yet. Share an insight, caveat, or question.
Miller et al. (2025) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: