The article reports three experiments designed to explore heuristics used in comparing the lengths of completed Euclidean Traveling Salesman Problem (E-TSP) tours. The experiments used paired comparisons in which participants judged which of two completed tours of the same point set was shorter. The first experiment manipulated two factors, the…

To explain human performance on the "Traveling Salesperson" problem (TSP), MacGregor, Ormerod, and Chronicle (2000) proposed that humans construct solutions according to the steps described by their convex-hull algorithm. Focusing on tour length as the dependent variable, and using only random or semirandom point sets, the authors…

fMRI was used to examine the differential effect of two problem-solving strategies. Participants were trained to use both a pictorial/spatial and a symbolic/algebraic strategy to solve word problems. While these two strategies activated similar cortical regions, a number of differences were noted in the level of activation. These differences…

The two-dimensional Traveling Salesperson Problem (TSP) requires finding the shortest tour through n locations. Untrained adults are adept at the task and reliably outperform simple construction algorithms for n= 60. Performance may stem from a specific inherent ability. Alternatively, it may reflect general spatial intelligence, whether inherent…