Math Is Fun Forum
  Discussion about math, puzzles, games and fun.   Useful symbols: ÷ × ½ √ ∞ ≠ ≤ ≥ ≈ ⇒ ± ∈ Δ θ ∴ ∑ ∫ • π ƒ -¹ ² ³ °

You are not logged in.

#1 2012-07-20 06:28:54

Real Member
From: The Foundation
Registered: 2011-05-23
Posts: 14,845

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-15 22:42:31)

“Here lies the reader who will never open this book. He is forever dead.

“Taking a new step, uttering a new word, is what people fear most.” ― Fyodor Dostoyevsky, Crime and Punishment


Board footer

Powered by FluxBB