This page lists useful techniques for solving the Tower of Hanoi.

The puzzle can be solved by a single, simple algorithm:

  1. Move the smallest disc from the top of its pile to another one
  2. Move the only other moveable disc to the only place it can go
  3. Repeat the above two steps until the puzzle is solved

Note that the smallest disc must always move the same way, i.e. if it is moved from the left-hand pole to the middle one on the first move, then it must move to the right-hand one the following time, then back to the left-hand one, and so on.