Tower of Hanoi

Tower of Hanoi: the Solver

Rules of the game

Object of the game is to move all the disks over
Tower 3. But you cannot place a larger disk onto
a smaller disk. For more details, please follow this link on Sololearn Tower of Hanoi
In our case, size of disk 1< size of disk 2< size of disk n with n>2; for the towers, Tower 1 is the left tower, Tower 2 the middle and Tower 3 the right tower.
This is a recursive version; click here if you want to see an iterative version.

Use your solver

Number of disks :

Tower of Hanoi(recursive version) : The solver