What is the least number of moves needed to solve the k-peg Towers of Hanoi problem?
Abstract
We prove that the solutions to the k-peg Tower of Hanoi Problem given by Frame and Stewart are minimal.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.