Pro version with no Ads! A 3D implementation of the classical mathematical puzzle "The Tower of Hanoi". The objective is to move the tower from the first pole to the last, making only one move at a time and without placing a bigger disk on top of a smaller one. Try to solve it in the minimal number of moves required! Try to beat your last time!
댓글