31 search results - page 1 / 7 » Optimality of an algorithm solving the Bottleneck Tower of H... |
TALG
2008
13 years 4 months ago
2008
We study the Bottleneck Tower of Hanoi puzzle posed by D. Wood
SOFSEM
2007
Springer
13 years 10 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 ...
TALG
2008
13 years 4 months ago
2008
The Tower of Hanoi problem is generalized by placing pegs on the vertices of a given directed graph G with two distinguished vertices, S and D, and allowing moves only along arcs o...
IEEECIT
2010
IEEE
13 years 3 months ago
2010
IEEE
—As we all know, Hanoi Problem is a classical case of recursive algorithm in programming. In this paper, we study the problem in another way by numbering the peg from bottom to t...
IPPS
2003
IEEE
13 years 9 months ago
2003
IEEE
Planning is an artificial intelligence problem with a wide range of real-world applications. Genetic algorithms, neural networks, and simulated annealing are heuristic search met...