- Tower of Hanoi is mathematical game or puzzle.
- It is also called as "Tower of Brahma" or "Lucas Tower ".
- The puzzle was invented by the French mathematician Edouard Lucas in 1883.
- It consists three towers and N number of different size disks placed one over other in decreasing size from bottom to top.
Example Tower of Hanoi
- Objective of this game is to move all the disks into another tower, by following the follow rules:
- Only one disk can be move at a time.
- Only the top disk can be removed.
- No large can be sit over a small disk.
- Tower of Hanoi with n disks can be solved minimum in 2n - 1 steps.For example, for 3 disks it takes 23−1 = 7 steps.
Solving with 3 desks
Applications of Tower of Hanoi:
- The Tower of Hanoi is frequently used in psychological research on problem solving
- The Tower of Hanoi is also used as a Backup rotation scheme when performing computer data Backups where multiple tapes/media are involved.
Solving with 4 desks