还原动画演示
柱子A 柱子B 柱子C
原理很简单
--益智汉诺塔的递推公式
local s=0 --累计步数local n=5 --求解的层数nlocal function move(pos1,pos3)s=s+1print("步数",s,pos1,"移动到>",pos3)endlocal function hanoi(n,pos1,pos2,pos3)if n==1 then move(pos1,pos3)elsehanoi(n-1,pos1,pos3,pos2)move(pos1,pos3)hanoi(n-1,pos2,pos1,pos3)endif n==0 then return endendprint(n,"层汉诺塔,解法步骤--共计步数:",(2^n)-1)hanoi(n,"A","B","C")