<![CDATA[Math Is Fun Forum / A Hanoi Towers generalization]]>2012-07-20T18:28:54ZFluxBBhttp://www.mathisfunforum.com/viewtopic.php?id=17981<![CDATA[A Hanoi Towers generalization]]>You have m poles of which two are labeled A and B. On the pole labeled A there are n rings which grow in size from the top down. What is the least number of moves required to move all rings from pole A to pole B, so they end up in the same configuration as on the pole A (grow in size from the top down), if one move consists of moving one and only one ring to any pole which has no rings or has rings all greater in size than the ring you are moving?]]>http://www.mathisfunforum.com/profile.php?id=1187862012-07-20T18:28:54Zhttp://www.mathisfunforum.com/viewtopic.php?pid=226724#p226724