Try Participate Learning — Better teaching through digital resources.

Tower Of Hanoi


by hanKit


Developer Notes

To solve a puzzle, move all the disks from one tower to another; only smaller disks can be placed atop larger ones, one at a time.

When manually moving a disk to a tower, it's sufficient to drop the disk in the vicinity of the receiving tower for it to be considered for addition to the tower;...