Towers of Hanoi

In front of you, you see three spires and three disks of three sizes piled on the leftmost spire.  The goal is to move all disks from the leftmost spire to the rightmost one in the least amount of moves.  

Here’s the trick: You can only move ONE disk at a time, to either an empty spire or to a spire with a larger disk already on it.

There are many solutions.  What’s yours?