Tower of Hanoi: Logic Puzzle
Tout public
info
10+
Téléchargements
Tout public
En savoir plus
À propos de ce jeu
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.
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.
Move every disc to the right peg — 3 to 8 discs, with undo and a hint.
Date de mise à jour
La sécurité, c'est d'abord comprendre comment les développeurs collectent et partagent vos données. Les pratiques concernant leur confidentialité et leur protection peuvent varier selon votre utilisation, votre région et votre âge. Le développeur a fourni ces informations et peut les modifier ultérieurement.
- Aucune donnée partagée avec des tiersEn savoir plus sur la manière dont les développeurs déclarent le partage
- Aucune donnée collectéeEn savoir plus sur la manière dont les développeurs déclarent la collecte
Nouveautés
• Visuals: the camera keeps the width on every screen, the palette is calmer, and the buttons wrap instead of spilling out of their column.
• Fix: the top line, the menu and the win screen still spoke Albanian on English phones. The whole screen now follows the device language — Albanian or English, never mixed.
• No gameplay change: the solver, the records and the reasoning trace stay as they were.
• Fix: the top line, the menu and the win screen still spoke Albanian on English phones. The whole screen now follows the device language — Albanian or English, never mixed.
• No gameplay change: the solver, the records and the reasoning trace stay as they were.
Tout public
En savoir plusAssistance de l'appli
À propos du développeur
ENISI CENTER SH.P.K.
shaban@spacecode.tech
Rr. Zahir Pajaziti 126
Podujeve
Kosovo
+383 45 601 379
