Opening book details…
Can I read On an infinite family of solvable Hanoi graphs on EtoBox?
On an infinite family of solvable Hanoi graphs by Dany Azriel; Noam Solomon; Shay Solomon is a Computer Science article available to read on EtoBox.
What is On an infinite family of solvable Hanoi graphs about?
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 of this graph. An optimal solution for such a graph __G__ is an algorithm that completes the task of moving a tower of any given number of disks from __S__ to __D__ in a minimal number of disk moves. In this article we present an algorithm which solves the problem for two infinite families of graphs, and prove its optimality. To the best of our knowledge, this is the first optimality proof for an __infinite__ family of graphs. Furthermore, we present a unified algorithm that solves the problem for a wider family of graphs and conjecture its optimality.
Who reads On an infinite family of solvable Hanoi graphs?
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- Dany Azriel; Noam Solomon; Shay Solomon
- Publisher
- ACM
- Published
- 2008
- Language
- EN
- Field
- Computer Science (Physical Sciences)