Visual representation of solving game named Towers of Hanoi.
More about Towers of Hanoi
Written using vanilla JavaScript and HTML's canvas.
The user can choose number of disks in range between 5 and 10, and then the program starts solving it recursively, until all disks are on the end peg.