The Tower of Hanoi is a mathematical game or puzzle.
It consists of three rods and a number of disks of different sizes, which can slide onto any rod. The puzzle starts with the disks in a neat stack in ascending order of size on one rod, the smallest at the top, thus making a conical shape.
The objective of the puzzle is to move the entire stack to another rod, obeying the following simple rules:
- Only one disk can be moved at a time.
- Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack or on an empty rod.
- No disk may be placed on top of a smaller disk.
Skich verwendet Cookies und ähnliche Technologien zur Bereitstellung, Verbesserung, Sicherung und Analyse unserer Dienste. Indem du auf „Alle akzeptieren“ klickst, erklärst du dich damit einverstanden, dass wir unsere Cookies und Cookies von Dritten verwenden gemäß unserer Cookies-Richtlinie.