Introduction to the Design and Analysis of Algorithms (2nd Edition)
Introduction to the Design and Analysis of Algorithms (2nd Edition)
Discrete Mathematics and Its Applications: And Its Applications
Discrete Mathematics and Its Applications: And Its Applications
The Little Towers of Antwerpen problem
Information Processing Letters
| Hi-index | 0.00 |
This paper presents a set of twelve problems related to Towers of Hanoi. The problems involve black and white disks and three poles. Various types of problems such as moving disks, splitting disks, merging disks, and moving towers are presented. Algorithms to solve the problems are also presented. The run times of the algorithms are analyzed using recurrence relations and their solutions. These problems can serve as examples and exercises in recursion in courses such as data structures, discrete mathematics, and algorithms.