The 3-disk Tower
of Hanoi Problem is shown above. The left figure depicts the
starting state and the right the goal state.
The animation above
shows the optimal solution to this problem. In the state space
depicted below, this optimal solution corresponds to the path
that begins at the apex of the large triangle and terminates
at the lower right of the large triangle.
