E N D
Tower of Hanoi Tower of Hanoi is a mathematical puzzle It consist of three rods and number of disk of different sizes In the beginning all the disk are placed in the source rod, in sorted order with smallest on top The goal is to move all the disks from source rod to target rod using an auxilliary rod by obeying these rules: Only one disk can be moved at a time Each move can take the disk on top of any rod and moved to another rod Larger disk should not be placed on a smaller disk at any time