The Hanoi-tower Problem with More Poles
Daoyun Xu · Journal of Tongren University · 2011
The usual Hanoi-tower game is played with three poles.The optimal moving number is in the game with n discs.In this paper,the Hanoi-tower problem with four poles is considered,and the corresponding solution is given.An interesting problem is how to take-value() would make the solution to be an optimal.The experiments show that is greater as the number of disc n increased in the optimal solution.And value in the optimal solution will stables at 0.9 for.