The towers of Hanoi revisited: Moving the rings by counting the moves. (English) Zbl 0487.90099


91A99 Game theory
68U99 Computing methodologies and applications
Full Text: DOI


[1] Aho, A.; Hopcroft, J.; Ullman, J., The Design and Analysis of Computer Algorithms (1974), Addison-Wesley: Addison-Wesley Reading, MA · Zbl 0326.68005
[2] Ball, R. R.W., Mathematical Recreations and Essays (1982), McMillan: McMillan London · Zbl 0029.19701
[3] Buneman, P.; Levy, L., The towers of Hanoi problem, Inform. Process. Lett., 10, 243-244 (1980) · Zbl 0439.05010
[4] Hayes, P. J., A note on the towers of Hanoi problem, Comput. J., 20, 282-285 (1977) · Zbl 0362.68057
[5] Wood, D., The towers of Brahma and Hanoi revisited, J. of Recreational Math., 14, 17-24 (1981) · Zbl 0486.05014
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.