Challenge · Challenge problem

The wizard's tower puzzle has $5$ golden disks of different sizes stacked on one of three pegs. A move takes the top disk of one peg to another peg, never onto a smaller disk. What is the fewest number of moves needed to move the whole stack to another peg?