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

7 votes227 views1 answer
How to find the location of a character in a string in python
Python
2 votes146 views2 answers
Install anaconda python 2.7 and 3.6
Python
121 votes146 views6 answers
Pandas rename
Python
3 votes180 views5 answers
Max function python
Python
6 votes184 views2 answers
Python list distinct
Python
0 vote143 views1 answer
Add field placeholder layout crispy modelform
Python
1 vote147 views1 answer
Cartesian product of a list python
Python
1 vote144 views1 answer
Except do nothing python
Python
0 vote162 views2 answers
Python web scraping project
Python
1 vote202 views1 answer
Django bulk update
Python Django