Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

4

CORR
2010
Springer

favoriteEmaildiscussreport

144views Education» more CORR 2010»

The Magnetic Tower of Hanoi

13 years 4 months ago

The Magnetic Tower of Hanoi

Download www.numerit.com

The classical Tower of Hanoi "puzzle" or "mathematical game", invented by the French mathematician Edouard Lucas in 1883, spans "base 2". The number of moves of each disk is given as a power of 2 and the total number of moves required to solve the puzzle with N disks is 2N

Uri Levy

Real-time Traffic

Classical Tower | CORR 2010 | Education | Mathematical Game | Mathematician Edouard Lucas |

claim paper

Related Content

» Optimality of an algorithm solving the Bottleneck Tower of Hanoi problem

» On generalized FrameStewart numbers

» On the FrameStewart algorithm for the multipeg Tower of Hanoi problem

» Generalizations of the Hanoi Towers Problem

» Nonrecursive Algorithm of Tower of Hanoi Problem

» In How Many Steps the k Peg Version of the Towers of Hanoi Game Can Be Solved

» On Optimal Solutions for the Bottleneck Tower of Hanoi Problem

» On an infinite family of solvable Hanoi graphs

» OntheFly Macros

Post Info
More Details (n/a)

Added	09 Dec 2010
Updated	09 Dec 2010
Type	Journal
Year	2010
Where	CORR
Authors	Uri Levy

Comments (0)