Bounded rationality in problem solving: Guiding search with domain-independent heuristics

Abstract

Humans exhibit the remarkable ability to solve complex, multi-step problems despite their limited capacity for search. We review the standard theory of problem solving, which posits that heuristic guidance makes this possible, but we also note that most studies have emphasized the role of domain-specific heuristics, which are not available for unfamiliar tasks, over more general ones. We describe FPS, a flexible architecture for problem solving that supports a variety of different strategies and heuristics, and we report its use in an experiment that studies the effectiveness of two domain-independent criteria. The results suggest that such heuristics can make problem solving far more tractable, and they are generally consistent with our claim that their use offsets the drawbacks of bounded rationality.