An Iterative Algorithm for the Tower of Hanoi with Four Pegs,I once gave a seminar (in German) for high-school students in connection with

Computing 42(1989), 133-140.The Tower of Hanoi, Enseign. Math. (2) 35(1989), 289-321.

(with A. Schief) The average distance on the Sierpiński gasket,

Probab. Theory Related Fields 87(1990), 129-138.Solution to Problem 1350 (Math. Mag. 63(1990), 189),

Math. Mag. 64(1991), 203.Shortest Paths between Regular States of the Tower of Hanoi,

Inform. Sci. 63(1992), 173-181.Pascal's Triangle and the Tower of Hanoi, Amer. Math. Monthly

99(1992), 538-544.Square-free Tower of Hanoi sequences, Enseign. Math. (2) 42(1996), 257-264.

The Tower of Hanoi, in: Shum, K.-P., Taft, E. J., Wan, Z.-X. (Eds.),

Algebras and Combinatorics, An International Congress, ICAC '97, Hong Kong,

Springer, Singapore, 1999, 277-289.(with J.-P. Bode ) Results and open problems on the Tower of Hanoi,

Congr. Numer. 139(1999), 113-122.(with D. Parisse) On the Planarity of Hanoi Graphs, Exposition. Math. 20(2002), 263-268.

(with S. Klavžar, U. Milutinović, D. Parisse, C. Petr) Metric properties

of the Tower of Hanoi graphs and Stern's diatomic sequence,

European J. Combin. 26(2005), 693-708.(with A. Kostov, F. Kneißl, F. Sürer, A. Danek) A mathematical model

and a computer tool for the Tower of Hanoi and Tower of London puzzles,

Inform. Sci. 179(2009), 2934-2947.(with A. H. Faber, N. Kühnpast, F. Sürer, A. Danek) The iso-effect:

Is there specific learning of Tower of London iso-problems?,

Thinking & Reasoning 15(2009), 237-249.Graph theory of tower tasks, Behavioural Neurology 25(2012), 13-22.

(with D. Parisse) The average eccentricity of Hanoi and Sierpiński graphs, Graphs Combin. 28(2012), 671-686.

(with D. Parisse) Coloring Hanoi and Sierpiński Graphs, Discrete Math. 312(2012), 1521-1535.

(with S. Klavžar and S. S. Zemljič) Sierpiński graphs as spanning subgraphs of Hanoi graphs, Cent. Eur. J. Math. 11(2013), 1153-1157.

(with C. Holz auf der Heide) An efficient algorithm to determine all shortest paths in Sierpiński graphs, Discrete Appl. Math. 177(2014), 111-120.

(with M. Freiberger) The Tower of Hanoi: Where mathematics meets psychology, Chapter 22 in: S. Parc (ed.), 50 Visions of Mathematics, Oxford University Press, Oxford, 2014.

(with S. Aumann, K. A. M. Götz and C. Petr) The number of moves of the largest disc in shortest paths on Hanoi graphs, Electron. J. Combin. 21(2014), P4.38.

the program

(This is a slightly extended version of an article in mathe-lmu.de 4(2001), 20-25.)

In collaboration with neuropsychologists and computer scientists we develop a computer tool for tower puzzles.

The corresponding poster has been awarded a **Second Prize** in the Poster competition of the International Congress of Mathematicians 2006 in Madrid.

I would be happy to hear from anyone interested in these topics.

In particular I am interested in any new development about the

Tower of Hanoi with more than three pegs. However, only serious

attempts to prove minimality of the presumed minimal solution

will be considered.

I am also looking for material about the biography of the inventor

of the Tower of Hanoi, the French mathematician Édouard Lucas,

who lived 1842-1891 (cf. my article in the * Monthly *).

Some people have taken up my challenge to hold a conference on the Tower of Hanoi, albeit not in Hanoi!

It was organized by
S. Klavžar, U. Milutinović, and C. Petr in the Slovenian
town of Maribor;

see
**Workshop on the Tower of Hanoi and Related Problems**
for details.

With my Slovenian colleagues I wrote a comprehensive book
**The Tower of Hanoi - Myths and Maths** ,

which has appeared at Birkhäuser/Springer Basel.

My further research interests cover
** analysis ** and
** other topics ** .

You may want to know more about my
** courses ** and
** lectures ** .

My coordinates are on my
** personal homepage ** .

A. M. Hinz, hinz@math.lmu.de, 2015-10-03