Tower of hanoi

/// find total number of steps 
int towerOfHanoi(int n) {
  /// pow(2,n)-1
  if (n == 0) return 0;
  
  return towerOfHanoi(n - 1) + 1 + towerOfHanoi(n - 1);
}

Tower of hanoi

# Recursive Python function to solve tower of hanoi
 
def TowerOfHanoi(n , from_rod, to_rod, aux_rod):
    if n == 0:
        return
    TowerOfHanoi(n-1, from_rod, aux_rod, to_rod)
    print("Move disk",n,"from rod",from_rod,"to rod",to_rod)
    TowerOfHanoi(n-1, aux_rod, to_rod, from_rod)
         
# Driver code
n = 4
TowerOfHanoi(n, 'A', 'C', 'B')
# A, C, B are the name of rods
 
# Contributed By Harshit Agrawal

Source: geeksforgeeks.org

Tower of Hanoi

def towerOfHanoi(N , source, destination, auxiliary):
	if N==1:
		print("Move disk 1 from source",source,"to destination",destination)
		return
	towerOfHanoi(N-1, source, auxiliary, destination)
	print("Move disk",N,"from source",source,"to destination",destination)
	towerOfHanoi(N-1, auxiliary, destination, source)
		
# Driver code
N = 3
towerOfHanoi(N,'A','B','C')
# A, C, B are the name of rods

Source: favtutor.com

Similar codes

0 vote98 views1 answer
C++ hide credentials
C++
0 vote114 views1 answer
Walk filesystem in c++
C++
-1 vote107 views1 answer
Istream c++
C++
1 vote100 views2 answers
C++ regex to validate indian phone number pattern
C++
0 vote62 views1 answer
Press enter to continue c++
C++
9 votes99 views4 answers
C++ vector print
C++
21 votes95 views5 answers
Print in c++
C++
17 votes92 views6 answers
C vs c++
C++
2 votes95 views1 answer
C++ read console input
C++
0 vote97 views1 answer
Typeid to string c++
C++