Nov 29, 2018
Tower of Hanoi Puzzle | Implementation of Recursive Algorithm | CS School
Tower of Hanoi Puzzle | Implementation of Recursive Algorithm | CS School
In a Tower of Hanoi we have a collection of three pegs. And we also have some number of discs of descending size. All of these discs have hole in the middle, so that we can easily fit them into the peg. In principle we might have n number of discs.
So the Puzzle begins with all discs stacked up from biggest to smallest on one spindle, and the goal is to move entire tower from one spindle to…
View On WordPress