Tower of Hanoi II

The Tower of Hanoi is a very old game that’s been around for a little more than a hundred years, and this is just a new variation on the same theme.
Believe it or not, the Tower of Hanoi is a mathematical puzzle put together by French mathematician Édouard Lucas back in 1883. It’s safe to say that it has been around for many years, and it’s likely that you’ve seen pretty much any variation on the subject.
Tower of Hanoi II is not a special game, and it doesn’t aim to do anything special. It just presents users with the old problem, but with a very slight complication. Numerous physical games were made over the years, and most of them are pretty simple, with just a few disks. The really big problem begins when there are more than four discs.

Least amount of moves

Like any puzzle games, it usually pays off to finish the game with the least amount of moves. It’s not a difficult thing to do when you only have four discs, but things get way more complicated when you add more discs.
In the Tower of Hanoi II iteration, there are nine discs, and it will take about 200 moves, at least, if you do everything correctly right from the start. Any wrong move can set you back for dozens of moves, which is turn will destroy any chance of getting the top score.
There are only some simple rules. The discs are arranged randomly when you start the game, so you won’t get the same problem twice. You can only move the discs from one pillar to the other if it’s of higher value.
For example, you can only move a 2 over a 3, and not the other way around. This puts some serious limitations on gameplay, and it will take users many experiments until they are able to finish the game in one sitting.
Tower of Hanoi II is based on Adobe Air, so you will have to install that along with the game, but it's a small package and won't take too long.