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!
Try with the sizes hidden so you have to remember which disk is which, and when you also mix the colors it will be almost impossible!
After you master one level, see if you can solve the puzzle with one more disk!
The app contains an automatic solver with controls to step, play and pause the solution, so that you can learn how to do it optimally.