python-Hanoi Recursive implementation

Excerpt from the commentary under the Liaoche Teacher's tutorial, personal memo, brain cells are dead

1 defMove from, to):#The animation effect needs to be mended by moving the plate from the2     Print( from,' -', to)3 4 defHanoi (N,SRC,TMP,DST):#move n plates from SRC to DST5     ifn = = 1:#there's only one plate in the case.6 Move (SRC,DST)7     Else:#There are more than one plate in the case8Hanoi (N-1,SRC,DST,TMP)#move the top n-1 tray from SRC to tmp9Move (SRC,DST)#easily and happily move the nth plate from SRC to DSTTenHanoi (N-1,TMP,SRC,DST)#wipe your butt and move the n-1 tray on TMP to DST . One  A  -Hanoi (3,'A','B','C')

Expected output:

1 #Expected output:2 #A -and C3 #A -and B4 #C --B5 #A -and C6 #B --A7 #B --C8 #A -and C9Move (3,'A','B','C')

python-Hanoi Recursive implementation