Towers of Hanoi

Towers of Hanoi is a famous puzzle that is often used to demonstrate recursion in CS courses. The objective is to transfer all of the discs from the one tower to another. However, you cannot pick up more than one disc at a time, you can only pick up the top disc of each respective stack, and you cannot place a larger disc on top of a smaller one.

The so-called "legend" is that Buddhist monks have been playing Towers of Hanoi with 64 discs since ancient times. Once they complete the game, the world will end. This may sound dire, but to complete such a puzzle, it would take about 585 BILLION YEARS! That is multiple times longer than the life of our universe.

I'm kind of fascinated with this puzzle so I decided to make my own little version to play whenever I want. Feel free to try it out for yourself!