Tower of Hanoi: Logic Puzzle

The classic puzzle, done properly: move all the discs to the right-hand peg, one at a time, and never place a larger disc on top of a smaller one.

Sounds simple. With 8 discs it takes 255 moves — and every single one of them has to be right.

WHAT YOU GET

• 3 to 8 discs. Start easy, work up.
• The minimum is shown next to your own move count, so you always know how close to perfect you are. (It is 2ⁿ−1 — for 8 discs, 255.)
• Your best score is kept for every level, separately.
• Undo, as many times as you need.
• A hint that shows you one correct move when you are stuck — never the whole solution.

NO ACCOUNT, NO INTERNET

The game runs completely offline. There is no sign-up, no password, and nothing to restore. Your records are kept on your own device.

WHY IT IS WORTH YOUR TIME

The Tower of Hanoi is the shortest honest lesson in recursion ever invented: to move a stack of n discs, you move n−1 out of the way, move the big one, then move the n−1 back. Children solve it by feel. Computer science students meet it again as their first proof. Both are right.

The game is in Albanian and English.

From SpaceCode.