Hanoi problem: 4 Pillars, if the number of the tower A,b,c,d Four, now to move the n disk from a all to D, moving rules unchanged

The solving procedure of four-column Hanoi tower problem. Thinking of solving problems: such as a,b,c,d four pillars. To move the nth disk of column A to the target column (D-Pillar), the upper part is divided into two parts, the upper part moves to the B-pillar, the lower half to the C-pillar, and the nth disk to the target pillar, then the C-pillar plate is moved to the target pillar and the B-pillar plate is moved to the target pillar Detail place: When the upper part is moved to the B-pillar, its middle variable column is two selected. While the lower half moves to the C-pillar, it has only one middle-variable pillar (because a pillar has been occupied by the upper part). B,c also moves to the target column in the same vein.

Hanoi problem: 4 Pillars, if the number of the tower A,b,c,d Four, now to move the n disk from a all to D, moving rules unchanged