Paper Info
Title
The density function of the number of moves to complete the Towers of Hanoi puzzle
Abstract
Any sequence of legal moves leads the Towers of Hanoi puzzle to an arrangement from which the final configuration must be built up. A recursive algorithm which finishes off the puzzle is considered and, assuming a uniform distribution on the possible unfinished situations, the density function of the number of moves it takes is derived.
Year
DOI
Venue
1984
10.1007/BF01874394
Annals OR
Keywords
DocType
Volume
Towers of Hanoi,error-correcting algorithm,probabilistic analysis,discrete density function,recurrence equations
Journal
1
Issue
Citations 
PageRank 
3
0
0.34
References 
Authors
11
2
Name
Order
Citations
PageRank
F. Scarioni110.70
M. G. Speranza229419.55