Mo'Minis

The famous game of hanoi towers : there are three towers - source, target and auxiliary. A number of rings with different sizes are put on the source tower according to their size : the biggest one at the bottom, the smallest one on the top. All the rings are to be moved one by one from the source tower to the target tower, using the auxiliary tower. The only rule : at no time can any ring be put on top of a smaller ring. The game given here has 4 versions : 1. Solve the problem from the initial state described above. The user first determines the number of rings he wishes to play with, and then starts giving pairs of numbers, one for the number of the tower from which the next ring is to be taken, one for the tower on top of which it should be put. An indication of the number of moves as well the time passing, is permanently given to the user. 2. Solve the problem from a random state. The user first determines the number of rings he wishes to play with, and then a random initial state is automatically chosen, from which the user should try and solve the original problem. 3. Solve the problem from the previous random state. The user is given once again the random initial state he last started from, so he can try to improve his performance regarding it. 4. See optimal automatic solution. The user first determines the number of rings he wishes to play with, and then he can see the optimal solution for this number of rings running slowly on the screen. The game is currently limited to 10 rings.