Traveling Salesman Problem (TSP)
Visit each of N points exactly once and return to start, minimising total path length. Performance reflects spatial planning and route-optimisation heuristics; humans typically solve small instances (N ≤ 20) near-optimally despite the NP-hard formulation. Distinct from Tower-style puzzles in lacking sub-goal structure.
- Executive Function
Indexed implementations 0
Metadata only — each row links to the authors' own page. A date in the last column is the last time an automated check confirmed the link loads; it is not a review of the task.
No implementation indexed for this paradigm yet.
Key references
- MacGregor, J. N., & Ormerod, T. (1996). Human performance on the traveling salesman problem. Perception & Psychophysics, 58(4), 527–539. doi:10.3758/bf03213088
- Vickers, D., Lee, M. D., Dry, M., & Hughes, P. (2003). The roles of the convex hull and the number of potential intersections in performance on visually presented traveling salesperson problems. Memory & Cognition, 31(7), 1094–1104. doi:10.3758/bf03196130