“河内塔”问题是数学的著名问题之一,本文给出“河内塔”问题的一般结论.问题1设有甲、乙、丙三根木柱,在甲柱上套有从小到大的3个圆盘,最大者在最下层(呈塔形),现在欲将这3个圆盘全部移到乙柱上,而每次只能移动最上面的一个圆盘,且每次移动中不能将大圆盘置于小圆盘之上,丙柱 The issue of Hanoi Tower is one of the famous problems of mathematics. This article gives the general conclusion of the issue of Hanoi Tower. Question 1 has three wooden pillars A, B, and C. Three pillars from small to large are placed on the pillar. The disc, the largest one in the lowest level (in a tower shape), now wants to move all three discs to the B-pillar, but only to move the top one disc at a time, and it cannot be large in each movement. The disc is placed on a small disc, the C-pillar