

Finally, it is shown that many features of previous models are embedded in the constraint elimination model. Find a way to get everyone to the other side, without ever leaving a group of rnissionaries in one place outnumbered by the cannibals in that place. Three missionaries and three cannibals are on one side of a river, along with a boat that can hold one or two people. Because successive eliminations of implicit constraints enlarge the problem space and have an effect on planning, the model integrates “plan-based” and “constraint-based” approaches to problem-solving behavior.Simulating individual protocols of Tower of Hanoi situations shows that the model, which has a proper set of constraints, predicts a single move with no alternative on about 61% of the movements and that protocols are quite successfully simulated movement by movement. The missionaries and cannibals problem is usually stated as follows. When impasses occur, a constraint elimination mechanism is applied. The model operates on goal-related rules and a set of constraint rules in the form of “if (state or goal), do not (Action)” for the explicit constraints in the instructions and the implicit constraints that come from misconceptions of legal moves. A general model of problem-solving processes based on misconception elimination is presented to simulate both impasses and solving processes.
