Python algorithm-Hanoi tower problem

Hanoi Tower Problem

Initial state:

thinking: When the number of plates is 3 , we write the moving order

Steps to move:

3 plates, from a to c

1, front two plates, from a to b

1) put the front plate from a to c

A->c

2) Take the second plate, from a to b

A->b

3) put The plates on C, from C to b .

C->b

2, the last plate, from a to c

A->c

3, put Two plates on B, from b to c

1) put the front plate from b to a

B->a

2) put the second plate, from b to c

B->c

3) put a plate on a, from a to c

A->c

Summarize:

n plates, from a to c

1,n-1 a plate from a to b

2, the last plate, from a to c

3.n-1 a plate from b to c

Code implementation:

#Encoding=utf-8 defHanoi (n,a,b,c):ifn = = 1:        PrintA' -', CElse: Hanoi (n-1, A,c,b) Hanoi (1, A,b,c) Hanoi (n-1, B,a,c)if __name__=='__main__': Hanoi (3,'a','b','C')

Python algorithm-Hanoi tower problem