jendral99 rtp

Theoretical Solution to the Tower of Hanoi Problem. tower bakrie Let’s name the towers as A,B,C and the disks as 1,2,3 We solve this question using simple recursion To get the three disks over to the final tower you need to : Take the disk number 1 and 2 to tower B Move disk number 3 to tower C Take disk number 1 and 2 from B to C