Hanoi with AutoSolver


4.4 ( 7364 ratings )
참고 게임 퍼즐 전략
개발자: Gianfranco Mazzucato
비어 있는

- 24/12/2013 1100 downloads!

Hanoi is a mathematical puzzle very addictive , consisting of three pegs and disks of varying sizes that can be placed in each one of the posts .

The game starts with all disks stacked on a stake in descending order, so as to form a cone. The aim of the game is to get all disks to the third peg , being able to move only one disk at a time and being able to put one disc to another disc larger, but not a smaller one.

++++++ AUTO-SOLUTION
This version of the game implements an auto-solution method that generates the animation of the solution. The resolving algorithm is very simple , it is not longer than 5 lines , and is potentially capable of solving any case , within the limits of current computers.

++++++ GAME CENTER INTEGRATION!
there is now a new leaderboard! Fun to climb the rankings!



The ancient legend says that the monks of Hanoi ( the capital city of Vietnam ) have managed to solve the puzzle with 64 disks , shifting one per second. We are still working, but assuming that the world will end in 5,845,580,504 centuries , when the sun becomes a red giant and burn the earth , most likely they will not succeed , being 18,446,744,073,709,551,615 moves they should do.

Will you be able to beat them ?