The paper discusses problems that arise when constructing a plan generator (problem solver), i. e. , a program charged with the task of linking actions which would transform a given initial state into a desired final state. Some frequently encountered difficulties are studied: loops, protected goals, incompatibilities. The examples given illustrate the present-day state of research in this field.