Question 15
The Tower of Daejeon consists of 7 disks of different sizes, arranged in increasing order of size from top to bottom on the first of three pegs. The task is to transfer the tower from the first peg to the third peg. In each move, the top disk from a peg may be transferred to the top of an adjacent peg. Thus transfers directly from the first peg to the third peg or vice versa are forbidden. A larger disk may never be on top of a smaller disk. What is the minimum number of moves required?