The traveling salesman problem (TSP) is a combinatorial optimization problem that requires finding the shortest path through a set of points ("cities") that returns to the starting point. Because humans provide heuristic near-optimal solutions to Euclidean versions of the problem, it has sometimes been used to investigate human visual…

Three experiments investigated the effects of two hints derived from the Criterion for Satisfactory Progress theory (CSP) and Representational Change Theory (RCT) on the cheap necklace problem (insight problem). In Experiment 1, fewer participants given the CSP hint used an incorrect (maximizing) first move than participants given the RCT hint or…

The Euclidean Traveling Salesperson Problem (E-TSP) is a useful task to study how humans optimize when faced with computational intractability. It has been found that humans are capable of finding high-quality solutions for E-TSP in a relatively short time and with seemingly little cognitive effort. This observation has led to two general…