The tower of Hanoi

zbMATH Open0746.05035MaRDI QIDQ1813640FDOQ1813640

Authors: Andreas M. Hinz 

Publication date: 25 June 1992

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

Recommendations

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

zbMATH Keywords

Tower of HanoiTower of Brahma

Mathematics Subject Classification ID

Paths and cycles (05C38)

Cited In (39)

• ECCENTRIC DISTANCE SUM OF SIERPIŃSKI GASKET AND SIERPIŃSKI NETWORK
• An iterative algorithm for the Tower of Hanoi with four pegs
• Title not available (Why is that?)
• Power domination in Knödel graphs and Hanoi graphs
• A survey and classification of Sierpiński-type graphs
• Some topics in the dynamics of group actions on rooted trees.
• Title not available (Why is that?)
• 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
• Distances in Sierpiński graphs and on the Sierpiński gasket
• Shortest paths in Sierpiński graphs
• The diameter of Hanoi graphs
• 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 maximum matchings in the Hanoi graphs using matching polynomials
• Enumeration of matchings in families of self-similar graphs
• Complexity of Toeplitz sequences
• Recognizing generalized Sierpiński graphs
• The number of moves of the largest disc in shortest paths on Hanoi graphs
• The Solution to a Hanoi-ing Little Problem
• Four encounters with Sierpiński's gasket
• Title not available (Why is that?)
• Sierpiński graphs as spanning subgraphs of Hanoi graphs
• An efficient algorithm to determine all shortest paths in Sierpiński graphs
• Random walks on dual Sierpinski gaskets
• On the planarity of Hanoi graphs
• 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
• The linear \(t\)-colorings of Sierpiński-like graphs
• 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)