This model solves Tower of Hanoi puzzle using the ActorRecursion actor.
A tower of disks initially stacked in increasing size on the source tower
shall be transferred to the destination tower, moving only at one disk at a
time and never a larger one onto a smaller through the third tower.
The number of disks can be adjusted through the parameter numberOfDisks.
The three towers are indexed as 0,1,2. The animation speed can be adjusted
through the parameter interpolationFactor.