ハノイの塔問題を解く [python]

ハノイの塔問題を解きます。pythonで書かれています。

hanoi.py

#!/usr/bin/python3
def movedisk(n,a,b):
    p=" LCR"
    if n>0:
        movedisk(n-1,a,6-a-b)
        print(f"Move disk{n} from {p[a]} to {p[b]}")
        movedisk(n-1,6-a-b,b)

if __name__=='__main__':
    n=int(input("number of disks? "))
    movedisk(n,1,2)

実行

$ python hanoi2.py
number of disks? 3
Move disk1 from L to C
Move disk2 from L to R
Move disk1 from C to R
Move disk3 from L to C
Move disk1 from R to L
Move disk2 from R to C
Move disk1 from L to C
$