Breaking News: Grepper is joining You.com. Read the official announcement!

python towers of hanoi

Bob Eskes answered on November 9, 2022 Popularity 6/10 Helpfulness 4/10

answer python towers of hanoi

python towers of hanoi

Comment

# Recursive Python function to solve the 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 = 4
TowerOfHanoi(n,'A','B','C')
# A, C, B are the name of rods
 
# Contributed By Dilip Jain

Popularity 6/10 Helpfulness 4/10 Language python

Source: www.geeksforgeeks.org

Tags: python towers-of-hanoi

Link to this answer
Share Copy Link