The Towers and Triangles of Professor Claus (or, Pascal Knows Hanoi)

REFERENCES

• A. Aho, J. Hopcroft and J. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley Publishing Co., Reading, MA, 1974.
   Google Scholar
• R. E. Allardice and A. Y. Fraser, La Tour d'Hanoï, Proc. Edinburgh Math. Soc. 2 (1884), 50–53.
   Google Scholar
• M. D. Atkinson, The cyclic Towers of Hanoi, Inform. Process. Lett. 13 (1981), 118–119.
   Web of Science ®Google Scholar
• W. W. Rouse Ball and H. S. M. Coxeter, Mathematical Recreations and Essays, 12th edition, University of Toronto Press, Toronto, 1974.
   Google Scholar
• E. R. Berlekamp, J. H. Conway and R. K. Guy, Winning Ways for Your Mathematical Plays, Academic Press, London, 1982.
   Google Scholar
• A. Brousseau, Tower of Hanoi with more pegs, J. Recreational Math. 8 (1976), 169–178.
   Google Scholar
• P. Buneman and L. Levy, The Towers of Hanoi Problem, Inform. Process. Lett. 10 (1980), 243–244.
   Web of Science ®Google Scholar
• T.-H. Chan, A statistical analysis of the Towers of Hanoi problem, Internat. J. Comput. Math. 28 (1989), 57–65.
   Web of Science ®Google Scholar
• D. W. Crowe, The n-dimensional cube and the Tower of Hanoi, Amer. Math. Monthly 63 (1956), 29–30.
   Google Scholar
• P. Cull and E. F. Ecklund, Jr., On the Towers of Hanoi and generalized Towers of Hanoi problems, Congr. Numer. 35 (1982), 229–238.
   Google Scholar
• P. Cull and E. F. Ecklund, Jr., Towers of Hanoi and analysis of algorithms, Amer. Math. Monthly 92 (1985), 407–420.
   Web of Science ®Google Scholar
• P. Cull and C. Gerety, Is Towers of Hanoi really hard? Congr. Numer. 47 (1985), 237–242.
   Google Scholar
• H. de Parville, La Tour d'Hanoï et la question du Tonkin, La Nature 12 (1884), 285–286.
   Google Scholar
• A. K. Dewdney, The Armchair Universe, W. H. Freeman, New York, 1986.
   Google Scholar
• A. K. Dewdney, The Turing Omnibus, Computer Science Press, New York, 1989.
   Google Scholar
• H. E. Dudeney, The Canterbury Puzzles and Other Curious Problems, E. P. Dutton, New York, 1908; 4th edition, Dover Publications, Inc., Mineola, NY, 1958.
   Google Scholar
• M. C. Er, A representation approach to the Tower of Hanoi Problem, Comput. J. 25 (1982), 442–447.
   Web of Science ®Google Scholar
• M. C. Er, An iterative solution to the generalized Towers of Hanoi problem, BIT 23 (1983), 295–302.
   Web of Science ®Google Scholar
• M. C. Er, An analysis of the generalized Towers of Hanoi problem, BIT 23 (1983), 429–435.
   Web of Science ®Google Scholar
• M. C. Er, The generalized Towers of Hanoi problem, J. Inform. Optim. Sci. 5 (1984), 89–94.
   Google Scholar
• M. C. Er, The cyclic Towers of Hanoi: A representation approach, Comput. J. 27 (1984), 171–175.
   Web of Science ®Google Scholar
• M. C. Er, The generalized colour Towers of Hanoi: An iterative algorithm, Comput. J. 27 (1984), 278–282.
   Web of Science ®Google Scholar
• M. C. Er, A generalization of the cyclic Towers of Hanoi: An iterative solution, Internat. J. Comput. Math. 15 (1984), 129–140.
   Web of Science ®Google Scholar
• M. C. Er, The complexity of the generalised cyclic Towers of Hanoi problem, J. Algorithms 6 (1985), 351–358.
   Web of Science ®Google Scholar
• M. C. Er, An optimal algorithm for Reve's puzzle, Inform. Sci. 45 (1988), 39–49.
   Web of Science ®Google Scholar
• N. J. Fine, Binomial coefficients modulo a prime, Amer. Math. Monthly 54 (1947), 589–592.
   Google Scholar
• J. S. Frame, Solution to Problem 3918, Amer. Math. Monthly 48 (1941), 216–217.
   Google Scholar
• M. Gardner, The Scientific American Book of Mathematical Puzzles and Diversions, Simon and Schuster, New York, 1959; revised edition, Hexaflexagons and Other Mathematical Diversions, University of Chicago Press, Chicago, 1988.
   Google Scholar
• M. Gardner, Knotted Doughnuts and Other Mathematical Entertainments, W. H. Freeman, New York, 1986.
   Google Scholar
• R. L. Graham, D. E. Knuth and O. Patashnik, Concrete Mathematics, Addison-Wesley Publishing Co., Reading, MA, 1989.
   Google Scholar
• P. J. Hayes, A note on the Towers of Hanoi problem, Comput. J 20 (1980), 243–244.
   Google Scholar
• P. J. Hilton, private communication.
   Google Scholar
• A. M. Hinz, The Tower of Hanoi, Enseign. Math. 35 (1989), 289–321.
   Google Scholar
• A. M. Hinz, An iterative algorithm for the Tower of Hanoi with four pegs, Computing 42 (1989), 133–140.
   Web of Science ®Google Scholar
• A. M. Hinz, Pascal's Triangle and the Tower of Hanoi, Amer. Math. Monthly 99(1992), 538–544.
   Web of Science ®Google Scholar
• A. M. Hinz, Shortest paths between regular states of the Tower of Hanoi, Inform. Sci. 63(1992), 173–181.
   Web of Science ®Google Scholar
• R. L. Kruse. Data Structures and Program Design, Prentice-Hall, Englewood Cliffs, NJ, 1984.
   Google Scholar
• I. Lavallée, Note sur le problème des Tours de Hanoï, Rev. Roumaine Math. Pures Appl. 30 (1985), 433–438.
   Google Scholar
• X. M. Lu, Towers of Hanoi graphs, Internat. J. Comput. Math. 19 (1986), 23–38.
   Web of Science ®Google Scholar
• X. M. Lu, Towers of Hanoi with arbitrary k ≥ 3 pegs, Internat. J. Comput. Math. 24 (1988), 39–54.
   Web of Science ®Google Scholar
• X. M. Lu, An iterative solution for the 4-peg Towers of Hanoi, Comput. J. 32 (1989), 187–189.
   Web of Science ®Google Scholar
• E. Lucas, Sur les congruences des nombres euleériens et les coefficients différentiels des fonctions trigonométriques suivant un module prémier, Bull. Soc. Math. France 6 (1878), 49–54.
   Google Scholar
• E. Lucas, Récréations Mathématiques, Gauthier-Villars, Paris, 1891–1894.
   Google Scholar
• E. Lucas, Théorie des Nombres, Gauthier-Villars, Paris, 1891.
   Google Scholar
• W. F. Lunnon, The Reve's Puzzle, Comput. J. 29 (1986), 478.
   Web of Science ®Google Scholar
• B. Mandelbrot, The Fractal Geometry of Nature, W. H. Freeman, San Francisco, 1982.
   Google Scholar
• S. B. Maurer and A. Ralston, Discrete Algorithmic Mathematics, Addison-Wesley Publishing Co., Reading, MA, 1990.
   Google Scholar
• S. Minsker, The Towers of Hanoi rainbow problem: Coloring the rings, J. Algorithms 10 (1989), 1–19.
   Web of Science ®Google Scholar
• R. B. Nelson, E. T. H. Wang and B. Poonen, Solution to Problem 1222, this Magazine 59 (1986), 241–242.
   Google Scholar
• H. Noland, problem 1350, this Magazine 63 (1990), 189.
   Google Scholar
• J. S. Rohl and T. D. Gedeon, The Reve's Puzzle, Comput. J. 29 (1986), 187–188; Corrigendum, Ibid. 31 (1988), 190.
   Web of Science ®Google Scholar
• T. Roth, The Tower of Brahma revisited, J. Recreational Math. 7 (1974), 116–119.
   Google Scholar
• F. Scarioni and H. G. Speranza, A probabilistic analysis of an error-correcting algorithm for the Towers of Hanoi puzzle, Inform. Process. Lett. 18 (1984), 99–103.
   Web of Science ®Google Scholar
• R. S. Scorer, P. M. Grundy and C. A. B. Smith, Some binary games, Math. Gaz. 28 (1944), 96–103.
   Google Scholar
• I. Stewart, Les fractals de Pascal, Pour la Science 129 (1988), 100–104.
   Google Scholar
• I. Stewart, Le lion, la lama et la laitue, Pour la Science 142 (1989), 102–107.
   Google Scholar
• B. M. Stewart, Solution to Problem 3918, Amer. Math. Monthly 48 (1941), 217–219.
   Google Scholar
• M. Sved, Problem 1222, this Magazine 58 (1985), 237.
   Google Scholar
• M. Sved, Divisibility—with visibility, Math. Intelligencer 10 (1988), 56–64.
   Web of Science ®Google Scholar
• S. Wagon, Mathematica in Action, W. H. Freeman, New York, 1991.
   Google Scholar
• T. R. Walsh, The Towers of Hanoi revisited: Moving the rings by counting the moves, Inform. Process. Lett. 15 (1982), 64–67.
   Web of Science ®Google Scholar
• T. R. Walsh, Iteration strikes back—at the cyclic Towers of Hanoi, Inform. Process. Lett. 16 (1983), 91–93.
   Web of Science ®Google Scholar
• S. Wolfram, Geometry of binomial coefficients, Amer. Math. Monthly 91 (1984), 566–571.
   Web of Science ®Google Scholar
• D. Wood, The Towers of Brahma and Hanoi revisited, J. Recreational Math. 14 (1981), 17–24.
   Google Scholar
• D. Wood, Adjudicating a Towers of Hanoi contest, Internat. J. Comput. Math. 14 (1983), 199–207.
   Web of Science ®Google Scholar