An implementation of the Tower of Hanoi in HTML and JavaScript
To solve this puzzle, all the disks from the leftmost tower have to be moved to the rightmost tower. Constraints:
>>Only one disk may be moved at a time.
>>It is not possible to place a bigger disk on a smaller one.
To move a disk:
>>Click once on the tower of the disk
>>Click on the tower you want the move the disk to.