A Python script that solves the Hanoi Towers puzzle.
From Wikipedia:
The Tower of Hanoi (also called The problem of Benares Temple, Tower of Brahma or Lucas's Tower, and sometimes pluralized as Towers, or simply pyramid puzzle) is a mathematical game or puzzle consisting of three rods and a number of disks of various diameters, which can slide onto any rod. The puzzle begins with the disks stacked on one rod in order of decreasing size, the smallest at the top, thus approximating a conical shape. The objective of the puzzle is to move the entire stack to one of the other rods, obeying the following rules:
- Only one disk may 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 disk that is smaller than it.
Python 3.x
Click the Code button, then click on "Download ZIP"
OR
Click the Hanoi Towers.py file, then click on the Download Raw File button.
- Enter the number of disks. It must be a positive integer. Then, press Enter.
- Enter the name of the starting peg. Then, press Enter.
- Enter the name of the destination peg. Then, press Enter.
- Enter the name of the auxiliary peg. Then, press Enter.
- The steps for solving the puzzle will be displayed on screen.
- Finally, press Enter to exit the program.
MIT License © 2025 Antonis Paraskevis