a discrete math problem on the book "rosen discrete mathematics and its applications 7th edition"
Given a positive integer n, list all the moves required in the Tower of Hanoi puzzle to move n disks from one peg to another according to the rules of the puzzle.