In this article we discuss a method for learning useful conditions on the application of operators during heuristic search Since learning is not attempted until a complete solution path has been found for a prob-lem, credit for correct moves and blame for incorrect moves is easily as-signed We review four learning systems that have incorporated similar techniques to learn in the domains of algebra, symbolic integration, and puzzle-solving We conclude that the basic approach of learning from solution paths can be applied t,o any situation in which problems can be solved by sequential search Finally, we examine some potential difficulties that may arise in more complex domains, and suggest some possible extensions for dealing with them. PEOPL...