Tower of Hanoi
A neat little puzzle called the Tower of Hanoi, invented by the French mathematician Edouard Lucas in 1883.
We are given a tower of 8 disks, initially stacked in decreasing size on 1 of 3 pegs.
The objective is to transfer the entire tower to one of the other pegs, moving only 1 disk at a time and never moving a larger one onto a smaller.
What is the minimum number of moves are required to achieve this goal?
Note: Moving one disk from one peg to another is considered as 1 move.