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 larger disk may be placed on top of a smaller disk.
With 3 disks, the puzzle can be solved in 7 moves. The minimal number of moves required to solve a Tower of Hanoi puzzle is 2n − 1, where n is the number of disks.
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.
