汉诺塔算法

hanoi.py

#!/usr/bin/env python

def move(origin, dest):
    print "%s -> %s" % (origin, dest)

def hanoi(n, origin, assist, dest):
    if n is 1:
        move(origin, dest)
    else:
        hanoi(n - 1, 'A', 'C', 'B')
        move(origin, dest)
        hanoi(n - 1, 'B', 'A', 'C')

def hanoi2(n, **kwargs):
    op = kwargs
    if n is 1:
        move(op["origin"], op["dest"])
    else:
        hanoi2(n-1, origin='A', dest='B', assist='C')
        move(op["origin"], op["dest"])
        hanoi2(n-1, origin='B', dest='C', assist='A')

if __name__ == '__main__':
    print '*' * 20
    hanoi(3, 'A', 'B', 'C')
    print '*' * 20
    hanoi2(3, origin='A', dest='C', assist='B')

Reference:
Wiki:汉诺塔