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 vote166 views1 answer
Pandas drop column by index range
Python
0 vote166 views1 answer
Creating a record in python
Python
2 votes176 views1 answer
How to change windows icon tkinter
Python
0 vote177 views1 answer
Padnas get list of rows
Python
2 votes172 views1 answer
Python recursive function return none
Python
5 votes152 views1 answer
Instead, it is recommended that you transition to using 'python3' from within Terminal.
Python
1 vote151 views2 answers
Python cmd colors
Python
0 vote167 views1 answer
Install pytorch on nvidia jetson nx
Python
1 vote171 views1 answer
How to check if its later than python
Python
2 votes179 views4 answers
Decision tree classifier sklearn
Python