The problem of the ``End of the world [\textit{W. W. R. Ball}, Mathematical recreations and essays. London: Macmillan Co. (1939; Zbl 0022.00101)] is related to the Tower of Brahma (Tower of Hanoi) in which the life period of our universe is estimated. In this paper the author has considered four different problems with three pegs and estimated the shortest path. Finally some remarks on open problems with more than three pegs have been made.
Recommendations
Cited in
(39)- Enumerating submultisets of multisets
- An iterative algorithm for the Tower of Hanoi with four pegs
- Shortest paths between regular states of the Tower of Hanoi
- The average distance on the Sierpiński gasket
- The generalized Towers of Hanoi for space-deficient computers and forgetful humans
- Four encounters with Sierpiński's gasket
- Complexity of Toeplitz sequences
- Power domination in Knödel graphs and Hanoi graphs
- Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence
- The average eccentricity of Sierpiński graphs
- The linear \(t\)-colorings of Sierpiński-like graphs
- The \((d, 1)\)-total labelling of Sierpiński-like graphs
- Distances in Sierpiński graphs and on the Sierpiński gasket
- Sierpiński graphs as spanning subgraphs of Hanoi graphs
- An efficient algorithm to determine all shortest paths in Sierpiński graphs
- Coloring Hanoi and Sierpiński graphs
- Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
- scientific article; zbMATH DE number 501074 (Why is no real title available?)
- Diameters, distortion, and eigenvalues
- Twin towers of Hanoi
- scientific article; zbMATH DE number 1488860 (Why is no real title available?)
- Growth of Schreier graphs of automaton groups.
- The Solution to a Hanoi-ing Little Problem
- scientific article; zbMATH DE number 6963586 (Why is no real title available?)
- The number of moves of the largest disc in shortest paths on Hanoi graphs
- Eccentric distance sum of Sierpiński gasket and Sierpiński network
- Coloring the square of Sierpiński graphs
- Recognizing generalized Sierpiński graphs
- A survey and classification of Sierpiński-type graphs
- Enumeration of maximum matchings in the Hanoi graphs using matching polynomials
- Enumeration of matchings in families of self-similar graphs
- Random walks on dual Sierpinski gaskets
- Resistance scaling and the number of spanning trees in self-similar lattices
- Some topics in the dynamics of group actions on rooted trees.
- On the planarity of Hanoi graphs
- A mathematical model and a computer tool for the Tower of Hanoi and Tower of London puzzles
- Shortest paths in Sierpiński graphs
- Hanoi graphs and some classical numbers
- The diameter of Hanoi 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)
