The tower of Hanoi

MaRDI QIDQ1813640zbMATH OpenFDO

Authors Andreas M. Hinz

Publication date 25 June 1992

Published in L'Enseignement Mathématique. 2e Série (Search for Journal in Brave)

zbMATH Keywords

Tower of HanoiTower of Brahma

Mathematics Subject Classification ID

Paths and cycles (05C38)

Recommendations

• scientific article; zbMATH DE number 1439478
• scientific article; zbMATH DE number 5485303
• scientific article; zbMATH DE number 1488860
• The Towers and Triangles of Professor Claus (or, Pascal Knows Hanoi)

Cited in

(39)

• The linear \(t\)-colorings of Sierpiński-like graphs
• An iterative algorithm for the Tower of Hanoi with four pegs
• scientific article; zbMATH DE number 1488860 (Why is no real title available?)
• A survey and classification of Sierpiński-type graphs
• Power domination in Knödel graphs and Hanoi graphs
• Some topics in the dynamics of group actions on rooted trees.
• scientific article; zbMATH DE number 501074 (Why is no real title available?)
• The generalized Towers of Hanoi for space-deficient computers and forgetful humans
• The average distance on the Sierpiński gasket
• The average eccentricity of Sierpiński graphs
• Shortest paths between regular states of the Tower of Hanoi
• Enumerating submultisets of multisets
• Hanoi graphs and some classical numbers
• Shortest paths in Sierpiński graphs
• The diameter of Hanoi graphs
• Distances in Sierpiński graphs and on the Sierpiński gasket
• Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence
• Diameters, distortion, and eigenvalues
• Twin towers of Hanoi
• Growth of Schreier graphs of automaton groups.
• The \((d, 1)\)-total labelling of Sierpiński-like graphs
• Enumeration of matchings in families of self-similar graphs
• Enumeration of maximum matchings in the Hanoi graphs using matching polynomials
• Complexity of Toeplitz sequences
• Eccentric distance sum of Sierpiński gasket and Sierpiński network
• The number of moves of the largest disc in shortest paths on Hanoi graphs
• Recognizing generalized Sierpiński graphs
• Four encounters with Sierpiński's gasket
• The Solution to a Hanoi-ing Little Problem
• Sierpiński graphs as spanning subgraphs of Hanoi graphs
• scientific article; zbMATH DE number 6963586 (Why is no real title available?)
• An efficient algorithm to determine all shortest paths in Sierpiński graphs
• On the planarity of Hanoi graphs
• Random walks on dual Sierpinski gaskets
• Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
• Coloring Hanoi and Sierpiński graphs
• Resistance scaling and the number of spanning trees in self-similar lattices
• A mathematical model and a computer tool for the Tower of Hanoi and Tower of London puzzles
• Coloring the square of Sierpiński graphs

This page was built for publication: The tower of Hanoi

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1813640)