University of Michigan - Ann Arbor

The problem of how to get all of the rings from peg 1 to peg 3 following 3 rules:
- 1) move one disc at a time
- 2) discs can only move if there aren't any others on it
- 3) larger discs can't be placed on smaller ones
It is solvable through the use of means-end analysis, subgoals and intermediate states.

Tower of Hanoi Problem

Goldstein, E. B. (2014). Cognitive psychology: Connecting mind, research and everyday experience. Nelson Education.


Learn Before

Related