On generalized Frame-Stewart numbers

13 years 5 months ago

Download hal.archives-ouvertes.fr

For the multi-peg Tower of Hanoi problem with k 4 pegs, so far the best solution is obtained by the Stewart's algorithm [15] based on the the following recurrence relation: Sk(n) = min 1tn 2

Jonathan Chappelon, Akihiro Matsuura

Real-time Traffic

CORR 2010 | Education | Hanoi Problem | Multi-peg Tower |

claim paper

» On the algebraic numbers computable by some generalized Ehrenfest urns

» Representing real numbers in a generalized numeration system

» A Generalization of Semenovs Theorem to Automata over Real Numbers

» UnderApproximations of Computations in Real Numbers Based on Generalized Affine Arithmetic

» A note on generalized chromatic number and generalized girth

» A graphtheoretic approach to quasigroup cycle numbers

» A Constraint on the Number of Distinct Vectors with Application to Localization

» Entropy Numbers of Linear Function Classes

Post Info
More Details (n/a)

Added	09 Dec 2010
Updated	09 Dec 2010
Type	Journal
Year	2010
Where	CORR
Authors	Jonathan Chappelon, Akihiro Matsuura

Comments (0)

Sciweavers

On generalized Frame-Stewart numbers

CORR 2010 | Education | Hanoi Problem | Multi-peg Tower |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers