When computer scientists discuss the computational complexity of, for example, finding the shortest path from building A to building B in some town or city, their starting point typically is a formal description of the problem at hand, e.g., a graph with weights on every edge where buildings correspond to vertices, routes between buildings to…

Results on human performance on the Traveling Salesman Problem (TSP) from different laboratories show high consistency. However, one exception is in the area of individual differences. While one research group has consistently failed to find systematic individual differences across instances of TSPs (Chronicle, MacGregor and Ormerod), another…