Concrete Mathematics Exercise Solution: Chapter 1[problem no: 2].

Question: 1.2: Find the shortest sequence of moves that transfers a tower of n disks from the left peg A to the right peg B, if direct moves between A and B are disallowed. (Each move must be or to or from the middle peg. As usual, a larger disk must never appear above a smaller one.)

Solution:

** click and open the photo for better view.