Python puzzle game Calculation Hanoi Tower problem Example

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

The code is 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 "Number of steps passed passing:%d"%times

