Hello coders!! In this article, we will explore and learn the coding of the game Tower of Hanoi in python. At first, we will learn about the game rules and then see the step by step implementation of the game in python. Without wasting any time, let’s dig into it.

Contents of Tutorial

## What is the Tower of Hanoi in Python?

It is a mathematical puzzle game in which we use three identical rods and n disks, all of the different sizes. The discs are arranged in the first rod, such that the largest disc is placed at the bottom and the smallest at the top. To solve the puzzle, one needs to arrange the disc in the same order in the last rod via the middle rod.

## Rules of Tower of Hanoi in Python:

- We can move only one disc at any given time
- Only the disc which is at the top can be moved and placed ontop at any other rod
- A disc can be placed on top of a bigger disc only

## An illustration of the Game:

Let us consider that initially there are 3 discs arranged as follows:

At first, we will move the disc from **A to C**

Now, we will move the disc from **A to B**

Next, we will move the disc of rod **C to B**

After this, we will move the disc from **A to C**

Now, move the disc from **B to A**

Next, we need to move the disc of rod **B to C**

And for the last step, we will move the disc form **A to C**, thus solving the puzzle

## Implementation of Tower of Hanoi in Python:

def TowerOfHanoi(n ,A, B, C): if n==1: print ("Moving disk from rod",A,"to",B ) return TowerOfHanoi(n-1, A, B, C) print( "Moving disk",n,"from rod",A,"to",C) TowerOfHanoi(n-1, B, C, A) n = 3 TowerOfHanoi(n,'A','B','C')

## Output:

### Explanation:

- Here, we have used recursive method for the implementation of the game
- The function TowerOfHanoi() takes four parameters
- Number of discs
- Source rod
- Auxiliary rod
- Destination rod

- It first checks the condition if the number of disc is 1, it directly moves it to the Destination rod and terminates the function
- Then, we have recursively called the function to move the remaining n-1 discs from source node to the auxiliary node, using the destination rod as the auxiliary
- After that, the 1 disk that is remaining is directly moved from the source rod to the auxiliary rod
- Lastly, we have again recursively called the the function to move the remaining n-1 rods from the auxiliary rod to the destination rod, using the source node as auxiliary

## Is it possible to solve Tower Of Hanoi without recursion?

This question can pop into anyone’s mind. Well, it is definitely possible. The tower of Hanoi problem can be solved non recursively as well by a **binary solution** approach where the n number of discs is encoded and represented in binary form of numbers 0 – 2^n.

## Time complexity for the recursive solution:

The time complexity for the recursive solution of Tower of Hanoi is **O(2^n)**, where n is the number of discs.

## Must Read

- Best Career Options With Python
- Rock Paper Scissors Game Development in Python
- Understanding Strand Sort in Python With Example

## Conclusion:

In this article, we learned in detail about the game of Tower of Hanoi and learned its recursive implementation in Python. We also elaborated the game concept in detail and finally saw an easy python code to implement it.

However, if you have any doubts or questions, do let me know in the comment section below. I will try to help you as soon as possible.

*Happy Pythoning!*