Tower of Hanoi Moves

Easy Recursion Fundamentals

Log in to solve

Print the minimum number of moves needed to move n disks from one peg to another using a third peg.

Constraints

1 <= n <= 60

No discussions yet.