Dynamic Programming Algorithm for the Generalized Towers of Hanoi Problem
Xiaodong Wang · Mini-micro Systems · 2005
Studied the generalized tower of Hanoi problem based on the dynamic programming algorithm. The properties of the partition points for the dynamic programming algorithm are analyzed thoroughly. A very simple formula for the partition point is given, and the dynamic programming algorithm is then changed to a very simple recursive algorithm. The new algorithm can generate the optimal move sequence for the generalized tower of Hanoi problem very quickly, therefore solves the generalized tower of Hanoi problem thoroughly.