The Tower of Hanoi Algorithm
Abstract
There is a famous puzzle called “The Tower of Hanoi.” In this puzzle, each disk has a single hole in the center and is stacked on a pole in descending order of size to form a tower. Once the tower is built on the leftmost pole, the goal is to move it to the rightmost pole. The puzzle comes with two rules: “only one disk can be moved at a time”, and “a larger disk cannot be placed on top of a smaller one”.
Fields of Study & Subjects
Teaching and Learning Programming
Advanced Combinatorial Mathematics
Optimization and Search Problems
Publication details
- Journal / source
- A K Peters/CRC Press eBooks
- Pages
- 124–127
- Publication date
- 17 February 2026
- Language
- EN
- Document type
- Book chapter