Summary: By using dividing, combining and a recursive method, we give an algorithm for solving the 6-pole Hanoi tower problem and list the step numbers of movements necessary for the 6-pole Hanoi tower problem by applying this algorithm. Based on the idea of cutting the natural number set, we put forward a time complexity formula and the number of remaining disks to calculate step numbers of movements necessary for the 6-pole Hanoi tower problem, and prove a time complexity formula by using mathematical induction.