汉诺塔问题---递归算法

汉诺塔问题

n个盘子，每次只允许移动一个盘子，大的必须在小的盘子下面。从a移动到c,如何设计算法实现？

def  hanoi（n,a,b,c）:
	if n >0:
		hanoi(n-1,a,c,b)
		print('from %s to %s' %(a,c))
		hanoi(n-1,b,a,c)

hanoi(3,'a','b','c')

运行结果：
from a to c
from a to b
from c to b
from a to c
from b to a
from b to c
from a to c