Find answers, ask questions, and connect with our
community around the world.

Activity Discussion Math What is the ‘Tower of Hanoi’ problem?

Tagged: 

  • What is the ‘Tower of Hanoi’ problem?

    Posted by GODHULI on May 20, 2021 at 3:05 am

    What is the ‘Tower of Hanoi’ problem? How can you solve it?

    Aashutosh replied 1 year, 6 months ago 2 Members · 1 Reply
  • 1 Reply
  • Aashutosh

    Member
    May 26, 2021 at 3:55 pm
    Helpful
    Up
    1
    Down
    Not Helpful
    ::

    Before writing this answer, I literally didn’t know what is “Tower of Hanoi”. After googling for hours and watching youtube I grasp the knowledge of what it is. So here are the few things which I have learned.

    The Tower of Hanoi is a mathematical problem that compromises three rods and multiple disks. Initially, all the disks are placed on one rod that too on one over the other in ascending order forming a cone-shaped tower.

    The aim of this problem is to move the pile of disks from the initial rod to another rod. as per these rules:

    1. No larger disk cannot be placed on top of a smaller disk.

    2. Only one disk can be moved at a particular time.

    3. A disk can only be moved if it is the uppermost disk in the rod.

    Let’s consider the rod A, B, and C and the disk 1, 2, and 3 which are placed on rod A as shown in fig. Follow these steps to solve the Tower Of Hanoi.

    1.Move the 1st disk from A to C.

    2. Move the 2nd disk from A to B.

    3. Move the 1st disk from C to B.

    4. Move the 3rd disk from A to C.

    5. Move the 1st disk from B to A.

    6. Move the 2nd disk from B to C.

    7. Move the 1st disk from A to C.

    And you’re problem is solved.

For Worksheets & PrintablesJoin Now
+