SyntaxFix

[recursion] Tower of Hanoi: Recursive Algorithm

Here goes the explanation. Look at the picture ->

enter image description here

By calling Movetower(3,a,b,c), you intend to move all the 3 discs from tower A to tower B. So the sequential calls are ->

1. Movetower(3,a,b,c)  // No Move needed
2. Movetower(2,a,c,b)  // No move needed
3. Movetower(1,a,b,c)  // Here is the time to move, move disc1 from a to b
4. Movetower(2,a,c,b)  // Returning to this call again, this is the time to move disc2 from a to c
5. Movetower(1,b,c,a)  // Again the time to move, this time disc1 from b to c
6. Movetower(3,a,b,c)  // Returning to this call again, this is the time to move disc3 from a to b
7. Movetower(2,c,b,a)  // Not the time to move
8. Movetower(1,c,a,b)  // Here is the time to move, move disc1 from c to a
9. Movetower(2,c,b,a)  // Returning to this call again, this is the time to move disc2 from c to b
10.Movetower(1,c,a,b)  // Here is the time to move, move disc1 from a to b

Hope it helps :)

For Animation : https://www.cs.cmu.edu/~cburch/survey/recurse/hanoiex.html

Examples related to recursion

• List all the files and folders in a Directory with PHP recursive function • Jquery Ajax beforeSend and success,error & complete • Node.js - Maximum call stack size exceeded • best way to get folder and file list in Javascript • Recursive sub folder search and return files in a list python • find all subsets that sum to a particular value • jQuery - Uncaught RangeError: Maximum call stack size exceeded • Find and Replace string in all files recursive using grep and sed • recursion versus iteration • Method to get all files within folder and subfolders that will return a list

Examples related to towers-of-hanoi

• Tower of Hanoi: Recursive Algorithm