ISSN:
1572-9338
Keywords:
Towers of Hanoi
;
error-correcting algorithm
;
probabilistic analysis
;
discrete density function
;
recurrence equations
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
,
Economics
Notes:
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.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01874394
Permalink