Sciweavers

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

12

CORR
2006
Springer

favoriteEmaildiscussreport

128views Education» more CORR 2006»

Generalizations of the Hanoi Towers Problem

13 years 4 months ago

Generalizations of the Hanoi Towers Problem

Download www.wisdom.weizmann.ac.il

Our theme bases on the classical Hanoi Towers Problem. In this paper we will define a new problem, permitting some positions, that were not legal in the classical problem. Our goal is to find an optimal (shortest possible) sequence of discs' moves. Besides that, we will research all versions of 3-pegs classical problem with some special constraints, when some types of moves are disallowed.

Sergey Benditkis, Ilya Safro

Real-time Traffic

Classical Problem | CORR 2006 | Education | Hanoi Towers Problem | Theme Bases |

claim paper

Related Content

» On generalized FrameStewart numbers

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

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

» On Optimal Solutions for the Bottleneck Tower of Hanoi Problem

» On an infinite family of solvable Hanoi graphs

» Nonrecursive Algorithm of Tower of Hanoi Problem

» A Genetic Approach to Planning in Heterogeneous Computing Environments

» Compressed Pattern Databases

» Integrating Function Application in StateBased Planning

Post Info
More Details (n/a)

Added	11 Dec 2010
Updated	11 Dec 2010
Type	Journal
Year	2006
Where	CORR
Authors	Sergey Benditkis, Ilya Safro

Comments (0)