以下是Python语言的程序实现:

def hanoi(n, A, B, C): if n == 1: print("Move disk 1 from", A, "to", C) return hanoi(n-1, A, C, B) print("Move disk", n, "from", A, "to", C) hanoi(n-1, B, A, C)

hanoi(5, 'A', 'B', 'C')

输出结果为:

Move disk 1 from A to C Move disk 2 from A to B Move disk 1 from C to B Move disk 3 from A to C Move disk 1 from B to A Move disk 2 from B to C Move disk 1 from A to C Move disk 4 from A to B Move disk 1 from C to B Move disk 2 from C to A Move disk 1 from B to A Move disk 3 from C to B Move disk 1 from A to C Move disk 2 from A to B Move disk 1 from C to B Move disk 5 from A to C Move disk 1 from B to A Move disk 2 from B to C Move disk 1 from A to C Move disk 3 from B to A Move disk 1 from C to B Move disk 2 from C to A Move disk 1 from B to A Move disk 4 from B to C Move disk 1 from A to C Move disk 2 from A to B Move disk 1 from C to B Move disk 3 from A to C Move disk 1 from B to A Move disk 2 from B to C Move disk 1 from A to C

输出有5个圆盘的汉诺塔移动结果要求借助B从A移到C--输出的结果程序

原文地址: http://www.cveoy.top/t/topic/b38e 著作权归作者所有。请勿转载和采集!

免费AI点我,无需注册和登录