汉诺塔-益智游戏

利用的递归函数，完成汉诺塔的结构

 

def test(n, a, b, c):
    if n == 1:
        print(a,'==>',c)
    else:
        test(n - 1, a, c, b)
        print(a,"-->",c)
        test(n - 1, b, a, c)
        # test(n)
test(3, 'A', 'B', 'C')

# 测试输出:

# A ==> C

# A --> B

# C ==> B

# A --> C

# B ==> A

# B --> C

# A ==> C
 

链接：https://www.liaoxuefeng.com/wiki/1016959663602400/1017268131039072#0