Tower of Hanoi

Game that I learned in CS137. There is a certain technique we can use to always win the game, and this can be done using CS137. There is a certain technique we can use to always win the game, and this can be done using Recursion.

To move n disks correctly (following the rules) from source (Left pole) to destination (Right pole):

• move $n-1$ disks correctly (following the rules) from source to middle pole
• move the one disk left from source to destination
• move $n-1$ disks correctly (following the rules) from middle pole to destination