python 實現漢諾塔問題

代碼如下：

def hano(n,x,y,z):
    if n==1:
        print(x,"->",z)
    else:
        #將n-1個盤子從x->y
        hano(n-1,x,z,y)
        #將剩余的最后一個盤子從x->z
        print(x,"->",z)
        #將剩余的n-1個盤子從y->z 
        hano(n-1,y,x,z)

n = int(input("請輸入漢諾塔的層數:"))

hano(n,"A","B","C")