Tower of Hanoi

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

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

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

Similar codes

1 vote126 views2 answers
Datetime to epoch
Python
1 vote132 views1 answer
Drop duplicate rows pandas except nan
Python
4 votes87 views1 answer
Python comma separated string to list
Python
11 votes131 views2 answers
Cross validation python
Python
16 votes109 views6 answers
Dataframe to dictionary
Python
5 votes136 views2 answers
Array of 1 to 100 python
Python
0 vote113 views1 answer
Pandas iloc include header
Python
0 vote125 views1 answer
Multipart Encoder
Python
12 votes114 views2 answers
Convert list to array python
Python
17 votes121 views6 answers
Input in python
Python