Tower of Hanoi with Recursion

# Recursive function for Tower of Hanoi
def hanoi(disks, source, helper, destination):
    # Base Condition
    if disks == 1:
        print(
            "Disk {} moves from tower {} to tower {}.".format(
                disks, source, destination
            ),
        )
        return
 
    # Recursive calls in which function calls itself
    hanoi(disks - 1, source, destination, helper)
    print("Disk {} moves from tower {} to tower {}.".format(disks, source, destination))
    hanoi(disks - 1, helper, source, destination)
 
 
# Driver code
disks = int(input("Number of disks to be displaced: "))
"""
Tower names passed as arguments:
Source: A
Helper: B
Destination: C
"""
# Actual function call
hanoi(disks, "A", "B", "C")