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

DOI10.1142/S1793830919300017zbMATH Open1407.00009arXiv1203.3280OpenAlexW2964239108MaRDI QIDQ4621297FDOQ4621297

Authors: Roberto Demontis 

Publication date: 11 February 2019

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

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

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

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

zbMATH Keywords

diskopen problemTower of Hanoiminimum numberFrame-Stewartpeg

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (2)

• A note on the frame-Stewart conjecture
• Title not available (Why is that?)

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)