To claim this discount you must purchase through the ordering link on this page. You cannot claim this discount by going through the software author's website. Orders Made from this Page use RegNow's Secure Order Server
Description :Solve Towers of Hanoi puzzle. You have a small collection of disks and three piles into which you can put them The disks all start on the leftmost pile, and you want to move them to the rightmost pile, never putting a disk on top of a smaller one. The middle pile for intermediate storage.
