Join our Discord to chat with fellow friendly gamers and our knowledgeable contributors!

Die Türme von Hanoi (Windows)

Die Türme von Hanoi Windows Title screen


Critic Score
100 point score based on reviews from various critics.
User Score
5 point score based on user ratings.
Not an American user?


In this game your job is to move a tower (big pieces at the bottom, small pieces at the top) from the left to the right using a middle pad.

The problem is that per turn you can only move the highest piece of the tower, and only so that the current piece you move can only be placed upon a bigger piece. This means you have to think ahead how you will swap the towers.

Depending on the level you select, you will have a starting tower with 3 pieces or up to 12 pieces.


Die Türme von Hanoi Windows Title screen
Die Türme von Hanoi Windows Now it gets difficult
Die Türme von Hanoi Windows oh my god
Die Türme von Hanoi Windows Won in 23 turns

Promo Images

There are no promo images for this game

Part of the Following Group

User Reviews

There are no reviews for this game.

Critic Reviews

There are no critic reviews for this game.


There are currently no topics for this game.



The optimal number of turns can be calculated using the easy formula of (2^n)-1, where n is the number of pieces.

If we assume that a player who does not need to think, needs about 2 seconds for every piece and all moves are perfect (no errors), this player can beat level 1 (3 pieces) in 14 seconds. However, this person would need 2 hours and 16 minutes for level 10 (12 pieces).
Xoleras (66712) added Die Türme von Hanoi (Windows) on Jun 21, 2007