The assessment of global optimization skills in procedural knowledge space theory

Luca Stefanutti, Andrea Brancaccio

Research output: Contribution to journalArticlepeer-review

Abstract

Procedural knowledge space theory aims to evaluate problem-solving skills using a formal representation of a problem space. Stefanutti et al. (2021) introduced the concept of the “shortest path space” to characterize optimal problem spaces when a task requires reaching a solution in the minimum number of moves. This paper takes that idea further. It expands the shortest-path space concept to include a wider range of optimization problems, where each move can be weighted by a real number representing its “value”. Depending on the application, the “value” could be a cost, waiting time, route length, etc. This new model, named the optimizing path space, comprises all the globally best solutions. Additionally, it sets the stage for evaluating human problem-solving skills in various areas, like cognitive and neuropsychological tests, experimental studies, and puzzles, where globally optimal solutions are required.

Original languageEnglish
Article number102907
JournalJournal of Mathematical Psychology
Volume125
Early online date2 Mar 2025
DOIs
Publication statusPublished - 1 May 2025

Keywords

  • Global/local optimization
  • Human problem-solving
  • Knowledge space
  • Problem space
  • Traveling salesman problem

Cite this