Power of Hanoi Mathematical Induction

Tower of Hanoi is a game in which there are disks of different sizes stacked onto of eachtoher in decreasing order "( smallest on top and largest on the bottom) and the whle point of the game s to move the disks across to another empty disk holder in the least amount of moves. For the power of hanoi, the mathematical induction began with 2^n, the number of moves it took to the initial tester to get the equation 2^n-1. This is then proven by plugging the variables into the induction equations and then solving to ring true.