Example of a python puzzle game computing Tower

The quanta (also known as Hanoi) problem is originated from an ancient legend of India's educational toys. When I created the world, da fan Tian made three diamond pillars, stacked 64 gold disks from bottom to top in order of size. The great fan Tian command Brahman re-placed the disc from below in order of size on another pillar. 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 codeThe 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,)

Test (12, "a", "B", "c ")
Print "passing: % d" % times