Hanoi's towers is an ancient problem which consists of three towers and some rings of progressive sizes, the game begins with all the rings in the far left tower organized the bigger one below, and the idea is to move them all to the far right tower with these two rules:
1. you can only move one ring at a time
2. there can never be a bigger ring on tom of a smaller one
check it out
P.S. I couldn't attach the program properly the previous time, so use this one
Oskilian
