MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

On the Frame-Stewart algorithm for the multi-peg Tower of Hanoi problem (2000) [4 citations — 1 self]

by Sandi Klavzar ,  Uros Milutinovic ,  Ciril Petr
Add To MetaCart

Abstract:

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 found. 1

Citations

11 Solution to advanced problem 3918 – Stewart - 1941
10 Solution to advanced problem 3918 – Frame - 1941
9 The Towers of Brahma and Hanoi revisited – Wood
7 Editorial note concerning advanced problem 3918 – Dunkel - 1941
7 Shortest paths between regular states of the Tower of Hanoi – Hinz - 1992
5 The Canterbury Puzzles (and Other Curious Problems – Dudeney - 1908
4 An iterative algorithm for the Tower of Hanoi with four pegs, Computing 42 – Hinz - 1989
4 Variations on the four-post Tower of Hanoi puzzle – Stockmeyer - 1994
3 Tower of Hanoi with more pegs – Brousseau - 1976
3 La Tour d'Hanoi, Jeu de calcul, Science et Nature 1(8 – Claus - 1884
3 The Tower of Hanoi: A historical survey and bibliography, manuscript – Stockmeyer - 1997
2 The towers and triangles of Professor Claus (or – Pool - 1994
2 The Tower of Brahma revisited – Roth - 1974
1 On the Towers of Hanoi and generalized Towers of Hanoi problems – Cull, Jr - 1982
1 The generalized p-peg Tower of Hanoi problem, Optimization 32 – Majumdar - 1995