19 search results - page 1 / 4 » Generalizations of the Hanoi Towers Problem |
CORR
2010
Springer
13 years 4 months ago
2010
Springer
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: ...
CORR
2006
Springer
13 years 4 months ago
2006
Springer
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 goa...
TALG
2008
13 years 4 months ago
2008
We study the Bottleneck Tower of Hanoi puzzle posed by D. Wood
DAM
2002
13 years 4 months ago
2002
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 ...
SOFSEM
2007
Springer
13 years 11 months ago
2007
Springer
We study two aspects of a generalization of the Tower of Hanoi puzzle. In 1981, D. Wood suggested its variant, where a bigger disk may be placed higher than a smaller one if their ...