Hanojskavez is function which displays solution Tower of Hanoi.
Hanojskavez(n, zkoliku, nakolik)
n is number of disks; zkoliku is place from are disks moving, nakolik is place, where should be every disks in right order.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.