This version uses search control rules to solve the TOH in the minimum number of moves.
The search control is as follows:
- Always alternate between moving the smallest disk and the other exposed disk that can move.
- Move the exposed disk to the one place it can move (the other disk that is bigger than it or an empty peg).
- Move the smallest disk to the peg it was not at last. This requires remembering the last peg the smallest disk was on and initializing this to the appropriate peg (the destination peg if there is an even number of disks, and the other peg if there is an odd number of disks).
- Basic PSCM functions: State Elaboration, Operator Proposal, Operator Evaluation, Internal Operator Application
- John Laird
- Soar 7-9