Upper estimates of complexity of algorithms for multi-peg Tower of Hanoi problem
Abstract
There are proved upper explicit estimates of complexity of algorithms: for multi-peg Tower of Hanoi problem with the limited number of disks, for Reve’s puzzle and for 5-peg Tower of Hanoi problem with the free number of disks.
References
N. Claus, La Tour d’Hanoi: jeu de calcul, Science et Nature 1 (1884), no. 8, 127-128.
##plugins.generic.googleScholarLinks.settings.viewInGS##
B. Houston, H. Masum, Explorations in 4-peg Tower of Hanoi, Carleton University Technical Report TR-04-10, November 2004.
##plugins.generic.googleScholarLinks.settings.viewInGS##
S. Klavžar, U. Milutinović, C. Petr, On the Frame–Stewart algorithm for the multi-peg Tower of Hanoi problem, Sixth Twente Workshop on Graphs and Combinatorial Optimization (Enschede, 1999), Discrete Appl. Math. 120 (2002), no. 1-3, 141-157.
##plugins.generic.googleScholarLinks.settings.viewInGS##
R.G. Rock, Reve’s Puzzle, http://www.rit.edu/ ̃rgr8261/Reves/RevesPuzzle.doc
##plugins.generic.googleScholarLinks.settings.viewInGS##
B.M. Stewart, J.S. Frame, Problems and Solutions: Advanced Problems: Solutions: 3918, Amer. Math. Monthly 48 (1941), no. 3, 216-219.
##plugins.generic.googleScholarLinks.settings.viewInGS##
P.K. Stockmeyer, The Tower of Hanoi: A Bibliography, September, 2005, http://www.cs.wm.edu/ ̃pkstoc/biblio2.pdf
##plugins.generic.googleScholarLinks.settings.viewInGS##
Game, http://www.mazeworks.com/hanoi/
##plugins.generic.googleScholarLinks.settings.viewInGS##
Formula, http://mathworld.wolfram.com/TowerofHanoi.html
##plugins.generic.googleScholarLinks.settings.viewInGS##
