"""
汉诺塔问题
缘由:在印度,有这么一个古老的传说:在世界中心贝拿勒斯(在印度北部)的圣庙里,一块黄铜板上插着三根宝石针。印度教的主神梵天在创造世界的时候,在其中一根针上从下到上地穿好了由大到小的64片金片,这就是所谓的汉诺塔。不论白天黑夜,总有一个僧侣在按照下面的法则移动这些金片:一次只移动一片,不管在哪根针上,小片必须在大片上面。僧侣们预言,当所有的金片都从梵天穿好的那根针上移到另外一根针上时,世界就将在一声霹雳中消灭,而梵塔、庙宇和众生也都将同归于尽。
解法:
若柱子标为A\B\C,要求从A搬到C。
1、如果只有一个盘子时,将它直接搬到C。
2、如果有两个盘子时,将B作为辅助柱子。即A->B,A->C,B->C。
3、若有n个盘子时,则移动所需次数为(2^n)-1。
比如,当盘子为64个时,需要移动2^64-1次。假设每秒移动一次,大约需要5850亿年。
"""
def towers_of_hanoi(n,A,B,C):
if n == 1:
print("Move sheet",n,"from",A,"to",C)
else:
towers_of_hanoi(n-1,A,C,B)
print("Move sheet",n,"from",A,"to",C)
towers_of_hanoi(n-1,B,A,C)
if __name__ == '__main__':
towers_of_hanoi(5,'A','B','C')
"""
运行结果:
Move sheet 1 from A to C
Move sheet 2 from A to B
Move sheet 1 from C to B
Move sheet 3 from A to C
Move sheet 1 from B to A
Move sheet 2 from B to C
Move sheet 1 from A to C
Move sheet 4 from A to B
Move sheet 1 from C to B
Move sheet 2 from C to A
Move sheet 1 from B to A
Move sheet 3 from C to B
Move sheet 1 from A to C
Move sheet 2 from A to B
Move sheet 1 from C to B
Move sheet 5 from A to C
Move sheet 1 from B to A
Move sheet 2 from B to C
Move sheet 1 from A to C
Move sheet 3 from B to A
Move sheet 1 from C to B
Move sheet 2 from C to A
Move sheet 1 from B to A
Move sheet 4 from B to C
Move sheet 1 from A to C
Move sheet 2 from A to B
Move sheet 1 from C to B
Move sheet 3 from A to C
Move sheet 1 from B to A
Move sheet 2 from B to C
Move sheet 1 from A to C
"""