Given 3 three pegs: leftmost peg A, middle peg B and rightmost peg C.
Find the shortest sequence of moves that transfers a tower of n disks from the left peg A to the right peg C,if direct moves between A and C are disallowed.
(Each move must be to or from the middle peg B.)
Constraints:
Initially the left peg A in stacked by n disks in the order of decreasing size.
Only one move cand be done at a time and never moving a larger one onto a smaller.
Number of moves can be greater than 2^64. ( QUITE LARGE VALUES )
1 <= n <= 35
Must Be Reminding You Of Sunny Sir's Lab