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 vote346 views1 answer
What is "\0" character in c++
C++
0 vote320 views1 answer
Why the << operator is friend
C++
0 vote315 views1 answer
Matplotlib hide numbers on axis
C++
1 vote358 views1 answer
Iff arduino
C++
2 votes354 views1 answer
Ue4 cpp OnHit
C++
0 vote319 views1 answer
Strcmp in c++ header file
C++
1 vote333 views1 answer
Fiunction in c++
C++
19 votes311 views1 answer
File handling in c++
C++
1 vote315 views4 answers
Convert preorder to postorder calculator
C++
0 vote361 views1 answer
Iterate const vector
C++