python递归解决汉诺塔问题

最新推荐文章于 2022-03-06 23:32:30 发布

吴天德少侠

最新推荐文章于 2022-03-06 23:32:30 发布

阅读量122

点赞数

本文链接：https://blog.csdn.net/sdhdsf132452/article/details/115535996

版权

python数据结构专栏收录该内容

61 篇文章 7 订阅

订阅专栏

本文通过Python代码展示了如何解决经典的汉诺塔问题。代码中定义了递归函数moveTower来移动不同高度的盘子，并使用辅助柱完成从A柱到C柱的移动过程。通过观察输出结果可以清晰地看到每一步移动的具体操作。

摘要由CSDN通过智能技术生成

兄弟萌，话不多说，show me the code!

def moveTower(height,fromPole,withPole,toPole):
    if height >= 1:
        moveTower(height-1,fromPole,toPole,withPole)
        moveDisk(height,fromPole,toPole)
        moveTower(height-1,withPole,fromPole,toPole)

def moveDisk(disk,fromPolem,toPole):
    print(f"Moving disk [{disk}] from {fromPolem} to {toPole}")


if __name__ == '__main__':
    moveTower(5,"a","b","c")

输出：

Moving disk [1] from a to c
Moving disk [2] from a to b
Moving disk [1] from c to b
Moving disk [3] from a to c
Moving disk [1] from b to a
Moving disk [2] from b to c
Moving disk [1] from a to c
Moving disk [4] from a to b
Moving disk [1] from c to b
Moving disk [2] from c to a
Moving disk [1] from b to a
Moving disk [3] from c to b
Moving disk [1] from a to c
Moving disk [2] from a to b
Moving disk [1] from c to b
Moving disk [5] from a to c
Moving disk [1] from b to a
Moving disk [2] from b to c
Moving disk [1] from a to c
Moving disk [3] from b to a
Moving disk [1] from c to b
Moving disk [2] from c to a
Moving disk [1] from b to a
Moving disk [4] from b to c
Moving disk [1] from a to c
Moving disk [2] from a to b
Moving disk [1] from c to b
Moving disk [3] from a to c
Moving disk [1] from b to a
Moving disk [2] from b to c
Moving disk [1] from a to c