The Towers of Hanoi Problem. (English) Zbl 0439.05010


05A99 Enumerative combinatorics
Full Text: DOI


[1] Bitner, J.R.; Erlich, G.; Reingold, E.M., Efficient generation of the binary reflected gray code and its applications, Comm. ACM, 19, 517-521, (1976) · Zbl 0333.94006
[2] O.P. Buneman and L.S. Levy, Gray code gleanings, Proc. 1978 Conference on Information Sciences and Systems, Johns Hopkins University.
[3] Gardner, M., Mathematical games: the curious properties of the gray code and how it can be used to solve puzzles, Sci. amer., 106-109, (1972)
[4] Hayes, P.J., A note on the towers of Hanoi problem, Comput. J., 282-285, (1977) · Zbl 0362.68057
[5] Knuth, D.E., Structured programming with gotos, Comput. surveys, (1974)
[6] Misra, J., Remark on algorithm 246, ACM trans. math. software, 1, 285, (1975)
[7] J. Misra, personal communication.
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. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.