The Tower of Hanoi – Myths and Maths

DOI10.1007/978-3-0348-0237-6zbMath1285.00003OpenAlexW4205817710WikidataQ60691729 ScholiaQ60691729MaRDI QIDQ2919650

Andreas M. Hinz, Sandi Klavžar, Ciril Petr, Uroš Milutinović

Publication date: 5 October 2012

Full work available at URL: https://doi.org/10.1007/978-3-0348-0237-6

zbMATH Keywords

Tower of Hanoi

Mathematics Subject Classification ID

Related Items (50)

Hankel determinants, Padé approximations, and irrationality exponents for \(p\)-adic numbers ⋮ On generalized Sierpiński graphs ⋮ Loopless Gray code enumeration and the Tower of Bucharest ⋮ Anti-Ramsey number of Hanoi graphs ⋮ Packing chromatic number of base-3 Sierpiński graphs ⋮ Peg solitaire game on Sierpinski graphs ⋮ A general method for computing Tutte polynomials of self-similar graphs ⋮ Back to the Tower ⋮ Computational solution of an old tower of Hanoi problem ⋮ On Vietoris-Rips complexes of hypercube graphs ⋮ New results on variants of covering codes in Sierpiński graphs ⋮ The 2-rainbow domination of Sierpiński graphs and extended Sierpiński graphs ⋮ Maximum matchings and minimum dominating sets in Apollonian networks and extended tower of Hanoi graphs ⋮ A growth model based on the arithmetic \(Z\)-game ⋮ Open problems for Hanoi and Sierpiński graphs ⋮ The worst parallel Hanoi graphs ⋮ The worst Hanoi graphs ⋮ An efficient algorithm to determine all shortest paths in Sierpiński graphs ⋮ Power domination in Knödel graphs and Hanoi graphs ⋮ The number and degree distribution of spanning trees in the Tower of Hanoi graph ⋮ Exponential vs. Subexponential Tower of Hanoi Variants ⋮ Calculating the dimension of the universal embedding of the symplectic dual polar space using languages ⋮ The Cyclic Towers of Antwerpen problem -- a challenging Hanoi variant ⋮ The number of moves of the largest disc in shortest paths on Hanoi graphs ⋮ Coloring the square of Sierpiński graphs ⋮ On distances in generalized Sierpiński graphs ⋮ Connectivity and some other properties of generalized Sierpiński graphs ⋮ A survey and classification of Sierpiński-type graphs ⋮ The median game ⋮ Looking back on Gauss and Gaussian legends: answers to the quiz from 37(4) ⋮ Maximum matchings in scale-free networks with identical degree distribution ⋮ A lower bound for weak Schur numbers with a deterministic algorithm ⋮ Generalized power domination: propagation radius and Sierpiński graphs ⋮ Metric properties of generalized Sierpiński graphs over stars ⋮ A note on the Frame–Stewart conjecture ⋮ Strong geodetic problem in networks ⋮ Two-player tower of Hanoi ⋮ Marcel Frémiot, determinism versus chaos, and the tower of Hanoi ⋮ Curing Instant Insanity II ⋮ Shortest paths in Sierpiński graphs ⋮ Degree sequence of the generalized Sierpiński graph ⋮ Unnamed Item ⋮ Traversal Languages Capturing Isomorphism Classes of Sierpiński Gaskets ⋮ Word calculus in the fundamental group of the Menger curve ⋮ Jacobi continued fraction and Hankel determinants of the Thue-Morse sequence ⋮ Recognizing generalized Sierpiński graphs ⋮ The Nonassociativity of the Double Minus Operation ⋮ On the treewidth of Hanoi graphs ⋮ On the roman domination number of generalized Sierpiński graphs ⋮ The outer-connected domination number of Sierpiński-like graphs

This page was built for publication: The Tower of Hanoi – Myths and Maths