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…

The Traveling Salesperson Problem (TSP) is a computationally difficult combinatorial optimization problem. In spite of its relative difficulty, human solvers are able to generate close-to-optimal solutions in a close-to-linear time frame, and it has been suggested that this is due to the visual system's inherent sensitivity to certain geometric…

Previous studies found that performance on the remote associates test (RAT) improves after a period of incubation and that increased alpha brain waves over the right posterior brain predict the emergence of RAT insight solutions. We report an experiment that tested whether increased alpha brain waves during incubation improve RAT performance.…

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…

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…