Tower of Hanoi Algorithm
- What does Tower of Hanoi mean?
Tower of Hanoi is a mathematical puzzle where we have three rods
and n disks arranged in ascending order from top to bottom.
The objective of the puzzle is to move the entire stack from rod to
another with r and obeying the following minimum number of moves
simple rules:
Only one disk can be moved at a time.
Each move consists of taking the upper disk from one of the stacks and
placing it on top of another stack i.e. a disk can only be moved if it is the
uppermost disk on a stack.
No disk may be placed on top of a smaller disk.
- Explanation of recursion definition in algorithm:
Using this link ( https://www.mathsisfun.com/games/towerofhanoi.html )
Let’s try to solve a puzzle – Tower of Hanoi using recursion.
Take an example with
2
disks solution takes
3
steps.
What if we have 3 disks?
solution takes
7
steps.
Recursively solve the problem of moving disk 1 and 2 from A to B as
example 1
Move disk 3 from A to C
Recursively solve the problem of moving disk 1and 2 from B to C
What if you have 4 disks?
solution takes
15
steps.
Recursively solve the problem of moving disk 1,2, and 3 from A to B
Move disk 4 from A to C
Recursively solve the problem of moving disk 1,2 and 3 from B to C.
