Affiliation:
1. I.T.A. Pellegrini, Sassari, Italy
Abstract
We prove that the solutions to the [Formula: see text]-peg Tower of Hanoi problem given by Frame and Stewart are minimal. The proof relies on first identifying that for any [Formula: see text]-disk, [Formula: see text]-peg problem, there is at least one minimal sequence is symmetric. We show that if we order the number moved required for the disks in the minimal symmetric sequence in an increasing manner and obtain the sequence [Formula: see text], then [Formula: see text]. We also prove that the maximum number of disks that can be moved using [Formula: see text] steps is [Formula: see text]. We use these to lower bound the telescopic sum (2) that is a lower bound on the number of moves required for any minimal symmetric sequence. This gives us the required result.
Publisher
World Scientific Pub Co Pte Lt
Subject
Discrete Mathematics and Combinatorics
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献