Challenge: Tower of Hanoi

Problem

We are given three rods in the Tower of Hanoi and n disks. Initially, all the disks are added to the first rod (the leftmost one) such that no smaller disk is under the larger one. The objective is to transfer the entire stack of disks from the first tower to the third tower (the rightmost one), moving ...