Step 1 : Shift first disk from 'A' to 'B'. a disk can only be moved if it is the uppermost disk on a stack. The objective of the puzzle is to move the entire stack to another rod, obeying the following simple rules: Tower of Hanoi is a mathematical puzzle where we have three rods and n disks.
ISRO CS Syllabus for Scientist/Engineer Exam.ISRO CS Original Papers and Official Keys.GATE CS Original Papers and Official Keys.