...centers. The radii of the disks are in an arithmetic progression (eg, 6 cm, 7 cm, 8 cm, 9 cm, ...) and are mounted on peg A. The rule is that no disk...one disk at a time, without violating the rule. The solution to the Towers of Hanoi game is naturally recursive: • Move the smaller n - 1 disks from...