Recursive solution to the Tower of Hanoi problem with N discs

TowerHanoi.py

def printMove(fr, to):
    print('move from ' + str(fr) + ' to ' + str(to))

def Towers(n, fr, to, spare):
    if n == 1:
        printMove(fr, to)
    else:
        Towers(n-1, fr, spare, to)
        Towers(1, fr, to, spare)
        Towers(n-1, spare, to, fr)

if __name__ == "__main__":
    Towers(3,"A","B","C")

Good walkthrough by Reducible here.