The Classical Tower of Hanoi Problem and Its Generalizations Vol. 3. Miscellaneous Topics

      Аннотация: This is the third of the series of books dealing with the theoretical and computational aspects of the classical Tower of Hanoi Problem (THP) and its various generalizations. ? Chapter 12 treats two 3-peg variants of the THP due to Minsker, namely, the Little Tower of Antwerpen and the Tower of Antwerpen ? Chapter 13 re-considers the Star Puzzle, derives some local-value relationships and then finds the solution directly from the corresponding recurrence relation ? Chapter 14 deals with the variant where the “divine” rule is relaxed, so that, during the transfer process, (at most) r times, a disc may be placed directly on top of a smaller one ? Chapter 15 analyzes in detail the recurrence relation introduced by Matsuura to find some interesting properties satisfied by the optimal value function, and then finds an independent solution ? Chapter 16 considers the optimality of the pms of the p-peg (p ? 4) THP ? The final Chapter 17 gives some open problems

Ключевые слова: Algorithm, Tower of Hanoi