The Classical Tower of Hanoi Problem and Its Generalizations Vol. 2 - Majumdar, A. A. K.
44,99 €
inkl. MwSt.
Versandkostenfrei*
Versandfertig in über 4 Wochen
  • Broschiertes Buch

This book deals with the theoretical and the computational aspects of some of the variants of the classical Tower of Hanoi Problem (THP). - Chapter 5 considers the three-in-a-row puzzle with n ( _ 1) discs and 3 pegs, where the movements of the discs are allowed between adjacent pegs only - Chapter 6 treats the cyclic THP with n discs and 3 pegs arranged in a circle, and the disc movements are allowed in the clockwise / counterclockwise direction - Chapter 7 deals with the variant with parallel moves, which allows four types of moves - exchange as well as the single, consecutive and circular…mehr

Andere Kunden interessierten sich auch für
Produktbeschreibung
This book deals with the theoretical and the computational aspects of some of the variants of the classical Tower of Hanoi Problem (THP). - Chapter 5 considers the three-in-a-row puzzle with n ( _ 1) discs and 3 pegs, where the movements of the discs are allowed between adjacent pegs only - Chapter 6 treats the cyclic THP with n discs and 3 pegs arranged in a circle, and the disc movements are allowed in the clockwise / counterclockwise direction - Chapter 7 deals with the variant with parallel moves, which allows four types of moves - exchange as well as the single, consecutive and circular moves - Chapter 8 studies the THP with cyclic parallel moves - Chapter 9 gives the bottleneck generalization where the movements of the discs are restricted by the bottleneck size - Some four-peg variants are given in Chapter 10 - The final Chapter 11 gives some open problems
Autorenporträt
The author is a professor in the Faculty of International Management at Ritsumeikan Asia-Pacific University (APU), Japan, from 2000. Before joining APU, he served as a Faculty Member in Jahangirnagar University, Dhaka University and BUET in Bangladesh, and Al-Fateh University in Libya. Research Interest:Mathematical Programming, Smarandache Numbers