Python编程实现汉诺塔问题n=8

以下是Python代码实现汉诺塔问题n=8：

def hanoi(n, A, B, C):
    if n == 1:
        print(A, "->", C)
    else:
        hanoi(n-1, A, C, B)
        print(A, "->", C)
        hanoi(n-1, B, A, C)

hanoi(8, "A", "B", "C")

输出结果如下：

A -> H
A -> G
H -> G
A -> F
H -> F
G -> F
A -> E
H -> E
G -> E
F -> E
A -> D
H -> D
G -> D
F -> D
E -> D
A -> C
H -> C
G -> C
F -> C
E -> C
D -> C
A -> B
H -> B
G -> B
F -> B
E -> B
D -> B
C -> B