What is the least number of moves needed to solve the k-peg Tower of Hanoi problem?

DOI10.1142/S1793830919300017MaRDI QIDQ4621297zbMATH OpenOpenAlexFDO

Authors Roberto Demontis

Publication date 11 February 2019

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1203.3280

zbMATH Keywords

diskopen problemTower of Hanoiminimum numberFrame-Stewartpeg

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Recreational mathematics (00A08)

Abstract: We prove that the solutions to the k-peg Tower of Hanoi Problem given by Frame and Stewart are minimal.

Recommendations

• On the Frame--Stewart Conjecture about the Towers of Hanoi
• A note on the Frame-Stewart conjecture on the generalized Tower of Hanoi problem
• The generalized_ppeg tower of hanoi problem
• scientific article; zbMATH DE number 1439478
• scientific article; zbMATH DE number 978252

Cites work

• Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence
• On the Frame-Stewart algorithm for the multi-peg Tower of Hanoi problem
• Shortest Paths in the Tower of Hanoi Graph and Finite Automata
• The fourth tower of Hanoi
• The n-Dimensional Cube and the Tower of Hanoi

Cited in

(2)

• scientific article; zbMATH DE number 3889555 (Why is no real title available?)
• A note on the frame-Stewart conjecture

This page was built for publication: What is the least number of moves needed to solve the \(k\)-peg Tower of Hanoi problem?

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