用递归思想解决
f(n) = f(n - 1) * 2 + 1;
python:
def move(n, a, b, c): if n == 1: print('move', a, '-->', c) else: move(n - 1, a, c, b) print('move', a, '-->', c) move(n - 1, b, a, c)
