Tower of Hanoi - Moves

The Tower of Hanoi (TOH) is an excellent problem for robotics research and education. From an algorithmic
perspective, Natural Algorithm (NA) has proven to be a successful way to deal with such complex systems.
This app provides a NA that is capable enough to solve TOH puzzle with finite number of towers and disks.

This app will let you know the total number of movements required to transfer m number of disk from source tower to destination tower. Here disk number could be from 1 to 30 and this is also same for the tower number too.