Python puzzle game Calculation Hanoi Tower problem example _python

Hanoi (also known as Heneta) is a puzzle toy from an ancient Indian legend. When the great Brahma created the world, he made three diamond pillars and stacked 64 gold discs on a pillar from the bottom up to the top in order of size. Brahma ordered the Brahman to rearrange the disc from below to another pillar in order of size. It is also stipulated that the disc cannot be enlarged on a small disc and only one disc can be moved between the three pillars at a time.

Copy Code code as follows:

Times = 0
def test (NUM,A,B,C):
Globaltimes
Ifnum==1:
Print (A,B)
Times+=1

Else
Test (NUM-1,A,C,B)
Test (1,A,B,C)
Test (Num-1,c,b,a)

Test ("A", "B", "C")
Print "The number of steps passing:%d"%times