Lecture Notes on 01 Mar 2023

# Recursive code to solve the Towers of Hanoi problem
def towers (n, source, spare, dest):
  if (n == 1):
    print ('Move disk from', source, 'to', dest)
  else:
    towers (n - 1, source, dest, spare)
    print ('Move disk from', source, 'to', dest)
    towers (n - 1, spare, source, dest)

def main():
  towers (4, 'A', 'B', 'C')

main()