this-1s-sparta/4-tower-hanoi

The Tower of Hanoi problem consists of 3 rods and 4 discs of different sizes. The goal of the problem is to move the stack of discs from the leftmost tower to the rightmost tower while also following the rules.

Python