I am currently looking into a problem of the Towers of Hanoi, in which I am aiming to understand the number of moves needed to get from an initial state to a desired state by fo
