Sciweavers

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

14

DAM
2002

favoriteEmaildiscussreport

280views more DAM 2002»

On the Frame-Stewart algorithm for the multi-peg Tower of Hanoi problem

13 years 4 months ago

On the Frame-Stewart algorithm for the multi-peg Tower of Hanoi problem

Download www.fmf.uni-lj.si

It is proved that seven different approaches to the multi-peg Tower of Hanoi problem are all equivalent. Among them the classical approaches of Stewart and Frame from 1941 can be found. Key words: Multi-peg Tower of Hanoi problem, Frame-Stewart algorithm, recursion, dynamic programming

Sandi Klavzar, Uros Milutinovic, Ciril Petr

Real-time Traffic

Classical Approaches | DAM 2002 | Hanoi Problem | Multi-peg Tower |

claim paper

Related Content

» On generalized FrameStewart numbers

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

» Nonrecursive Algorithm of Tower of Hanoi Problem

» On an infinite family of solvable Hanoi graphs

» A Genetic Approach to Planning in Heterogeneous Computing Environments

» Prioritized gossip in vehicular networks

Post Info
More Details (n/a)

Added	18 Dec 2010
Updated	18 Dec 2010
Type	Journal
Year	2002
Where	DAM
Authors	Sandi Klavzar, Uros Milutinovic, Ciril Petr

Comments (0)