Geeksforgeeks

It's live! The biggest programming festival has begun! Check out Geek Week now!

Error

The tower of Hanoi is a famous puzzle where we have three rods and **N** disks. The objective of the puzzle is to move the entire stack to another rod. You are given the number of discs **N**. Initially, these discs are in the rod 1. You need to print all the steps of discs movement so that all the discs reach the 3^{rd} rod. Also, you need to find the total moves.

**Note: **The discs are arranged such that the** top disc is numbered 1 **and the** bottom-most disc is numbered N**. Also, all the discs have **different sizes** and a bigger disc **cannot** be put on the top of a smaller disc. Refer the provided link to get a better clarity about the puzzle.

**Example 1:**

**Input:
**N = 2
**Output:
**move disk 1 from rod 1 to rod 2
move disk 2 from rod 1 to rod 3
move disk 1 from rod 2 to rod 3
3**
Explanation: **For N=2 , steps will be
as follows in the example and total
3 steps will be taken.

**Example 2:**

**Input:
**N = 3
**Output:
**move disk 1 from rod 1 to rod 3
move disk 2 from rod 1 to rod 2
move disk 1 from rod 3 to rod 2
move disk 3 from rod 1 to rod 3
move disk 1 from rod 2 to rod 1
move disk 2 from rod 2 to rod 3
move disk 1 from rod 1 to rod 3
7**
Explanation: **For N=3 , steps will be
as follows in the example and total
7 steps will be taken.

**Your Task:**

You don't need to read input or print anything. You only need to complete the function **toh()** that takes following parameters: **N** (number of discs), **from** (The rod number from which we move the disc), **to** (The rod number to which we move the disc), **aux** (The rod that is used as an auxiliary rod) and prints the required moves inside function body (See the example for the format of the output) as well as return the count of total moves made. The total number of moves are printed by the driver code.

**Please take care of the case of the letters.**

**Expected Time Complexity: **O(2^{N}).

**Expected Auxiliary Space: **O(N).

**Constraints:**

1 <= N <= 16

We are replacing the old Disqus forum with the new Discussions section given below.

Click here to view old Disqus comments.

Click here to view old Disqus comments.

Login to report an issue on this page.

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

YesLoading...

Tower Of Hanoi

...