Move the whole stack to the right-hand peg. Click the peg you are taking from, then the peg you are putting it on.

• One disc at a time, and never a larger disc onto a smaller one.
• The minimum is 2ⁿ−1 moves: 15 for four discs, 255 for eight.
• The trick is recursive: move n−1 discs aside, move the big one, move them back.

Hint plays the next move of the optimal solution — watch it a few times and the recursion becomes obvious.