Discussion about math, puzzles, games and fun. Useful symbols: ÷ × ½ √ ∞ ≠ ≤ ≥ ≈ ⇒ ± ∈ Δ θ ∴ ∑ ∫ • π ƒ -¹ ² ³ °
You are not logged in.
#1 2012-07-21 04:28:54
- anonimnystefy
- Real Member
Offline
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?
Last edited by anonimnystefy (2012-09-16 20:42:31)
The limit operator is just an excuse for doing something you know you can't.
“It's the subject that nobody knows anything about that we can all talk about!” ― Richard Feynman
“A secret's worth depends on the people from whom it must be kept.” ― Carlos Ruiz Zafón